./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:39:34,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:39:34,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:39:34,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:39:34,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:39:34,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:39:34,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:39:34,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:39:34,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:39:34,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:39:34,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:39:34,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:39:34,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:39:34,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:39:34,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:39:34,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:39:34,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:39:34,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:39:34,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:39:34,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:39:34,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:39:34,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:39:34,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:39:34,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:39:34,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:39:34,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:39:34,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:39:34,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:39:34,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:39:34,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:39:34,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:39:34,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:39:34,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:39:34,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:39:34,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:39:34,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:39:34,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:39:34,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:39:34,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:39:34,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:39:34,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:39:34,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:39:34,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5 [2024-11-20 02:39:34,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:39:34,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:39:34,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:39:34,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:39:34,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:39:34,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i [2024-11-20 02:39:36,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:39:36,382 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:39:36,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i [2024-11-20 02:39:36,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07e1ea829/ed780d4018d248d3bfbcff925dd54d27/FLAG7df4e9e7b [2024-11-20 02:39:36,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07e1ea829/ed780d4018d248d3bfbcff925dd54d27 [2024-11-20 02:39:36,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:39:36,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:39:36,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:39:36,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:39:36,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:39:36,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682c02a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36, skipping insertion in model container [2024-11-20 02:39:36,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:39:36,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i[917,930] [2024-11-20 02:39:36,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:39:36,735 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:39:36,748 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i[917,930] [2024-11-20 02:39:36,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:39:36,833 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:39:36,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36 WrapperNode [2024-11-20 02:39:36,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:39:36,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:39:36,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:39:36,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:39:36,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,917 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-20 02:39:36,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:39:36,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:39:36,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:39:36,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:39:36,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,975 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:39:36,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:36,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:37,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:37,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:37,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:37,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:39:37,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:39:37,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:39:37,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:39:37,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (1/1) ... [2024-11-20 02:39:37,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:39:37,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:39:37,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:39:37,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:39:37,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:39:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:39:37,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:39:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:39:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:39:37,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:39:37,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:39:37,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:39:37,770 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-20 02:39:37,771 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:39:37,791 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:39:37,793 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:39:37,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:39:37 BoogieIcfgContainer [2024-11-20 02:39:37,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:39:37,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:39:37,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:39:37,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:39:37,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:39:36" (1/3) ... [2024-11-20 02:39:37,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3f80aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:39:37, skipping insertion in model container [2024-11-20 02:39:37,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:39:36" (2/3) ... [2024-11-20 02:39:37,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3f80aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:39:37, skipping insertion in model container [2024-11-20 02:39:37,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:39:37" (3/3) ... [2024-11-20 02:39:37,804 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-46.i [2024-11-20 02:39:37,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:39:37,818 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:39:37,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:39:37,893 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@388e6154, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:39:37,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:39:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:39:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 02:39:37,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:39:37,915 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:39:37,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:39:37,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:39:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash -805995562, now seen corresponding path program 1 times [2024-11-20 02:39:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:39:37,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188037112] [2024-11-20 02:39:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:39:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:39:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:39:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:39:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:39:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:39:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:39:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:39:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:39:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:39:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:39:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:39:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:39:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:39:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:39:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:39:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:39:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:39:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:39:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:39:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:39:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:39:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:39:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 02:39:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:39:38,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:39:38,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188037112] [2024-11-20 02:39:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188037112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:39:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:39:38,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:39:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278109473] [2024-11-20 02:39:38,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:39:38,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:39:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:39:38,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:39:38,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:39:38,406 INFO L87 Difference]: Start difference. First operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:39:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:39:38,432 INFO L93 Difference]: Finished difference Result 145 states and 248 transitions. [2024-11-20 02:39:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:39:38,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-11-20 02:39:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:39:38,440 INFO L225 Difference]: With dead ends: 145 [2024-11-20 02:39:38,440 INFO L226 Difference]: Without dead ends: 72 [2024-11-20 02:39:38,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:39:38,446 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:39:38,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:39:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-20 02:39:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-20 02:39:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:39:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2024-11-20 02:39:38,500 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 141 [2024-11-20 02:39:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:39:38,501 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2024-11-20 02:39:38,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:39:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2024-11-20 02:39:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 02:39:38,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:39:38,507 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:39:38,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:39:38,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:39:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:39:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash -103296540, now seen corresponding path program 1 times [2024-11-20 02:39:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:39:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877222950] [2024-11-20 02:39:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:39:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:39:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:39:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:39:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:39:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:39:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:39:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:39:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:39:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:39:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:39:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:39:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:39:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:39:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:39:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:39:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:39:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:39:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:39:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:39:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:39:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:39:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:39:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 02:39:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:39:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:39:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877222950] [2024-11-20 02:39:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877222950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:39:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:39:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 02:39:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030339696] [2024-11-20 02:39:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:39:47,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:39:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:39:47,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:39:47,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:39:47,925 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:39:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:39:49,562 INFO L93 Difference]: Finished difference Result 231 states and 334 transitions. [2024-11-20 02:39:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:39:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-20 02:39:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:39:49,567 INFO L225 Difference]: With dead ends: 231 [2024-11-20 02:39:49,567 INFO L226 Difference]: Without dead ends: 162 [2024-11-20 02:39:49,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:39:49,569 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 210 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 02:39:49,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 372 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 02:39:49,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-20 02:39:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2024-11-20 02:39:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.328358208955224) internal successors, (89), 68 states have internal predecessors, (89), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:39:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-20 02:39:49,606 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 142 [2024-11-20 02:39:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:39:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-20 02:39:49,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:39:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-20 02:39:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 02:39:49,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:39:49,614 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:39:49,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:39:49,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:39:49,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:39:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 154868898, now seen corresponding path program 1 times [2024-11-20 02:39:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:39:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146719410] [2024-11-20 02:39:49,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:39:49,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:39:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:39:49,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231505755] [2024-11-20 02:39:49,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:39:49,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:39:49,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:39:49,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:39:49,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:39:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:39:49,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-20 02:39:49,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:39:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 246 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-20 02:39:51,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:39:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 72 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-20 02:39:55,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:39:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146719410] [2024-11-20 02:39:55,883 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 02:39:55,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231505755] [2024-11-20 02:39:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231505755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:39:55,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:39:55,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12] total 32 [2024-11-20 02:39:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721108709] [2024-11-20 02:39:55,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:39:55,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-20 02:39:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:39:55,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-20 02:39:55,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2024-11-20 02:39:55,891 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 32 states, 32 states have (on average 2.65625) internal successors, (85), 30 states have internal predecessors, (85), 10 states have call successors, (39), 7 states have call predecessors, (39), 12 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41) [2024-11-20 02:40:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:40:02,266 INFO L93 Difference]: Finished difference Result 446 states and 572 transitions. [2024-11-20 02:40:02,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-11-20 02:40:02,267 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 30 states have internal predecessors, (85), 10 states have call successors, (39), 7 states have call predecessors, (39), 12 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41) Word has length 142 [2024-11-20 02:40:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:40:02,270 INFO L225 Difference]: With dead ends: 446 [2024-11-20 02:40:02,270 INFO L226 Difference]: Without dead ends: 360 [2024-11-20 02:40:02,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4373 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2770, Invalid=9440, Unknown=0, NotChecked=0, Total=12210 [2024-11-20 02:40:02,276 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 375 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:40:02,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 790 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 02:40:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-20 02:40:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 129. [2024-11-20 02:40:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:40:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2024-11-20 02:40:02,309 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 142 [2024-11-20 02:40:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:40:02,310 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2024-11-20 02:40:02,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 30 states have internal predecessors, (85), 10 states have call successors, (39), 7 states have call predecessors, (39), 12 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41) [2024-11-20 02:40:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2024-11-20 02:40:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 02:40:02,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:40:02,318 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:40:02,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 02:40:02,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:40:02,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:40:02,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:40:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1235516935, now seen corresponding path program 1 times [2024-11-20 02:40:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:40:02,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718325008] [2024-11-20 02:40:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:40:02,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:40:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:40:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:40:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:40:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:40:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:40:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:40:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:40:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:40:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:40:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:40:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:40:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:40:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:40:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:40:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:40:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:40:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:40:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:40:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:40:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:40:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:40:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 02:40:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:40:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:40:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718325008] [2024-11-20 02:40:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718325008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:40:12,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:40:12,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:40:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723179527] [2024-11-20 02:40:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:40:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:40:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:40:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:40:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:40:12,283 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:40:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:40:15,228 INFO L93 Difference]: Finished difference Result 352 states and 470 transitions. [2024-11-20 02:40:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 02:40:15,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-11-20 02:40:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:40:15,231 INFO L225 Difference]: With dead ends: 352 [2024-11-20 02:40:15,231 INFO L226 Difference]: Without dead ends: 226 [2024-11-20 02:40:15,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:40:15,234 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 235 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 02:40:15,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 352 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 02:40:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-20 02:40:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 131. [2024-11-20 02:40:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:40:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2024-11-20 02:40:15,259 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 143 [2024-11-20 02:40:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:40:15,259 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2024-11-20 02:40:15,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:40:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2024-11-20 02:40:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 02:40:15,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:40:15,261 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:40:15,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:40:15,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:40:15,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:40:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash 648710921, now seen corresponding path program 1 times [2024-11-20 02:40:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:40:15,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312299291] [2024-11-20 02:40:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:40:15,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:40:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:40:15,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282083290] [2024-11-20 02:40:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:40:15,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:40:15,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:40:15,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:40:15,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 02:40:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:40:15,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:40:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:40:15,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:40:15,619 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:40:15,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:40:15,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 02:40:15,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:40:15,829 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 02:40:15,938 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:40:15,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:40:15 BoogieIcfgContainer [2024-11-20 02:40:15,942 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:40:15,943 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:40:15,943 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:40:15,943 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:40:15,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:39:37" (3/4) ... [2024-11-20 02:40:15,947 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:40:15,948 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:40:15,949 INFO L158 Benchmark]: Toolchain (without parser) took 39532.12ms. Allocated memory was 151.0MB in the beginning and 446.7MB in the end (delta: 295.7MB). Free memory was 95.8MB in the beginning and 321.1MB in the end (delta: -225.3MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2024-11-20 02:40:15,950 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:40:15,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.60ms. Allocated memory is still 151.0MB. Free memory was 95.8MB in the beginning and 79.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 02:40:15,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.77ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 73.7MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:40:15,952 INFO L158 Benchmark]: Boogie Preprocessor took 104.13ms. Allocated memory is still 151.0MB. Free memory was 73.7MB in the beginning and 67.8MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:40:15,952 INFO L158 Benchmark]: RCFGBuilder took 769.86ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 67.4MB in the beginning and 160.8MB in the end (delta: -93.4MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-20 02:40:15,952 INFO L158 Benchmark]: TraceAbstraction took 38146.83ms. Allocated memory was 211.8MB in the beginning and 446.7MB in the end (delta: 234.9MB). Free memory was 159.7MB in the beginning and 321.1MB in the end (delta: -161.4MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2024-11-20 02:40:15,952 INFO L158 Benchmark]: Witness Printer took 5.39ms. Allocated memory is still 446.7MB. Free memory is still 321.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:40:15,953 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.60ms. Allocated memory is still 151.0MB. Free memory was 95.8MB in the beginning and 79.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.77ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 73.7MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.13ms. Allocated memory is still 151.0MB. Free memory was 73.7MB in the beginning and 67.8MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 769.86ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 67.4MB in the beginning and 160.8MB in the end (delta: -93.4MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38146.83ms. Allocated memory was 211.8MB in the beginning and 446.7MB in the end (delta: 234.9MB). Free memory was 159.7MB in the beginning and 321.1MB in the end (delta: -161.4MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * Witness Printer took 5.39ms. Allocated memory is still 446.7MB. Free memory is still 321.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_10 = 999.2; [L32] float var_1_11 = 63.75; [L33] signed long int var_1_12 = 100000; [L34] unsigned short int var_1_13 = 8; [L35] signed long int var_1_14 = 2; [L36] signed long int var_1_15 = 32; [L37] unsigned short int var_1_16 = 64; [L38] double var_1_17 = 127.5; [L39] double var_1_18 = 32.75; [L40] signed char var_1_19 = 0; [L41] unsigned long int var_1_20 = 128; VAL [isInitial=0, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] FCALL updateLastVariables() [L136] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L93] var_1_3 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L94] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L97] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L102] var_1_7 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L103] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L104] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L105] var_1_8 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L106] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L107] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L108] var_1_10 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L109] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L110] var_1_11 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L111] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L112] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L113] var_1_14 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L114] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L115] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L116] var_1_15 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L117] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L118] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L118] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L119] var_1_16 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L120] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L121] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L121] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L136] RET updateVariables() [L137] CALL step() [L45] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L46] COND TRUE var_1_2 && stepLocal_0 [L47] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L51] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L58] var_1_6 = var_1_5 VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L60] COND FALSE !(-100000 >= var_1_1) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L63] COND FALSE !((var_1_10 / var_1_11) == 999999.6f) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L67] COND TRUE var_1_6 < var_1_1 VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L68] COND FALSE !(var_1_5 == (~ (var_1_6 + var_1_1))) [L71] var_1_12 = ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8))) VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L76] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L76] EXPR var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))) VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L76] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) [L83] var_1_13 = var_1_16 VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L85] var_1_17 = var_1_18 [L86] var_1_19 = 5 [L87] var_1_20 = var_1_15 VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L137] RET step() [L138] CALL, EXPR property() [L128] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= var_1_1) ? (var_1_9 == ((unsigned short int) (((((var_1_1 + var_1_5)) > (64)) ? ((var_1_1 + var_1_5)) : (64))))) : (((var_1_10 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_6 < var_1_1) ? ((var_1_5 == (~ (var_1_6 + var_1_1))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_6)) ? (-1) : (var_1_6))))) ? (var_1_5) : (((((-1) < (var_1_6)) ? (-1) : (var_1_6)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_9)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_1)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_16))) VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L128-L129] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= var_1_1) ? (var_1_9 == ((unsigned short int) (((((var_1_1 + var_1_5)) > (64)) ? ((var_1_1 + var_1_5)) : (64))))) : (((var_1_10 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_6 < var_1_1) ? ((var_1_5 == (~ (var_1_6 + var_1_1))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_6)) ? (-1) : (var_1_6))))) ? (var_1_5) : (((((-1) < (var_1_6)) ? (-1) : (var_1_6)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_9)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_1)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_16)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L19] reach_error() VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 820 mSDsluCounter, 1621 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1185 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1681 IncrementalHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 436 mSDtfsCounter, 1681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4380 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=4, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 392 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 25.2s InterpolantComputationTime, 996 NumberOfCodeBlocks, 996 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 8090 SizeOfPredicates, 7 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 4302/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:40:16,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:40:18,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:40:18,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:40:18,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:40:18,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:40:18,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:40:18,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:40:18,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:40:18,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:40:18,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:40:18,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:40:18,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:40:18,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:40:18,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:40:18,386 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:40:18,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:40:18,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:40:18,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:40:18,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:40:18,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:40:18,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:40:18,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:40:18,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:40:18,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:40:18,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:40:18,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:40:18,393 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:40:18,393 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:40:18,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:40:18,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:40:18,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:40:18,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:40:18,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:40:18,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:40:18,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:40:18,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:40:18,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:40:18,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:40:18,396 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:40:18,396 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:40:18,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:40:18,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:40:18,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:40:18,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:40:18,398 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5 [2024-11-20 02:40:18,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:40:18,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:40:18,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:40:18,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:40:18,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:40:18,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i [2024-11-20 02:40:20,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:40:20,665 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:40:20,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i [2024-11-20 02:40:20,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bcbd2fb/d2fce3381b9f41caabfab70e53cdc2a1/FLAG0b98d4dc2 [2024-11-20 02:40:20,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bcbd2fb/d2fce3381b9f41caabfab70e53cdc2a1 [2024-11-20 02:40:20,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:40:20,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:40:20,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:40:20,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:40:20,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:40:20,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:40:20" (1/1) ... [2024-11-20 02:40:20,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a91ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:20, skipping insertion in model container [2024-11-20 02:40:20,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:40:20" (1/1) ... [2024-11-20 02:40:20,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:40:20,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i[917,930] [2024-11-20 02:40:21,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:40:21,022 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:40:21,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i[917,930] [2024-11-20 02:40:21,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:40:21,095 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:40:21,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21 WrapperNode [2024-11-20 02:40:21,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:40:21,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:40:21,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:40:21,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:40:21,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,162 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-20 02:40:21,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:40:21,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:40:21,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:40:21,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:40:21,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,205 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:40:21,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:40:21,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:40:21,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:40:21,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:40:21,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (1/1) ... [2024-11-20 02:40:21,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:40:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:40:21,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:40:21,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:40:21,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:40:21,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:40:21,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:40:21,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:40:21,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:40:21,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:40:21,432 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:40:21,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:40:23,971 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 02:40:23,971 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:40:23,990 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:40:23,991 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:40:23,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:23 BoogieIcfgContainer [2024-11-20 02:40:23,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:40:23,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:40:23,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:40:23,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:40:24,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:40:20" (1/3) ... [2024-11-20 02:40:24,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29675c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:40:24, skipping insertion in model container [2024-11-20 02:40:24,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21" (2/3) ... [2024-11-20 02:40:24,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29675c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:40:24, skipping insertion in model container [2024-11-20 02:40:24,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:23" (3/3) ... [2024-11-20 02:40:24,005 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-46.i [2024-11-20 02:40:24,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:40:24,023 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:40:24,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:40:24,097 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c1cf8f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:40:24,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:40:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:40:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 02:40:24,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:40:24,130 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:40:24,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:40:24,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:40:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash -250232366, now seen corresponding path program 1 times [2024-11-20 02:40:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:40:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481274021] [2024-11-20 02:40:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:40:24,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:40:24,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:40:24,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:40:24,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:40:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:24,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:40:24,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:40:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-20 02:40:24,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:40:24,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:40:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481274021] [2024-11-20 02:40:24,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481274021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:40:24,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:40:24,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:40:24,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479572603] [2024-11-20 02:40:24,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:40:24,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:40:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:40:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:40:24,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:40:24,600 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:40:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:40:24,624 INFO L93 Difference]: Finished difference Result 118 states and 206 transitions. [2024-11-20 02:40:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:40:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 137 [2024-11-20 02:40:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:40:24,635 INFO L225 Difference]: With dead ends: 118 [2024-11-20 02:40:24,635 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 02:40:24,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:40:24,645 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:40:24,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:40:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 02:40:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-20 02:40:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:40:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2024-11-20 02:40:24,697 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 137 [2024-11-20 02:40:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:40:24,697 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2024-11-20 02:40:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:40:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-20 02:40:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 02:40:24,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:40:24,705 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:40:24,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:40:24,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:40:24,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:40:24,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:40:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1348772776, now seen corresponding path program 1 times [2024-11-20 02:40:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:40:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614672031] [2024-11-20 02:40:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:40:24,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:40:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:40:24,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:40:24,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:40:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:40:25,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 02:40:25,305 INFO L278 TraceCheckSpWp]: Computing forward predicates...