./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_normal_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_normal_file-97.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 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:08:47,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:08:48,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:08:48,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:08:48,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:08:48,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:08:48,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:08:48,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:08:48,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:08:48,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:08:48,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:08:48,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:08:48,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:08:48,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:08:48,136 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:08:48,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:08:48,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:08:48,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:08:48,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:08:48,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:08:48,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:08:48,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:08:48,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:08:48,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:08:48,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:08:48,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:08:48,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:08:48,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:08:48,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:08:48,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:08:48,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:08:48,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:08:48,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:08:48,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:08:48,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:08:48,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:08:48,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:08:48,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:08:48,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:08:48,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:08:48,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:08:48,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:08:48,152 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 -> 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c [2024-10-13 00:08:48,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:08:48,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:08:48,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:08:48,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:08:48,451 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:08:48,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-10-13 00:08:49,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:08:50,164 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:08:50,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-10-13 00:08:50,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8f3db94/b3cd68da70e34981841019f34f428cf2/FLAGb9f6c93a5 [2024-10-13 00:08:50,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8f3db94/b3cd68da70e34981841019f34f428cf2 [2024-10-13 00:08:50,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:08:50,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:08:50,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:08:50,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:08:50,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:08:50,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a08cf67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50, skipping insertion in model container [2024-10-13 00:08:50,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:08:50,429 WARN L248 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_normal_file-97.i[913,926] [2024-10-13 00:08:50,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:08:50,501 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:08:50,513 WARN L248 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_normal_file-97.i[913,926] [2024-10-13 00:08:50,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:08:50,592 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:08:50,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50 WrapperNode [2024-10-13 00:08:50,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:08:50,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:08:50,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:08:50,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:08:50,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,685 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-10-13 00:08:50,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:08:50,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:08:50,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:08:50,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:08:50,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,734 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-10-13 00:08:50,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:08:50,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:08:50,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:08:50,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:08:50,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (1/1) ... [2024-10-13 00:08:50,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:08:50,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:08:50,815 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-10-13 00:08:50,817 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-10-13 00:08:50,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:08:50,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:08:50,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:08:50,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:08:50,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:08:50,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:08:50,939 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:08:50,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:08:51,433 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:08:51,433 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:08:51,470 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:08:51,470 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:08:51,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:51 BoogieIcfgContainer [2024-10-13 00:08:51,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:08:51,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:08:51,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:08:51,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:08:51,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:08:50" (1/3) ... [2024-10-13 00:08:51,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b736b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:51, skipping insertion in model container [2024-10-13 00:08:51,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:50" (2/3) ... [2024-10-13 00:08:51,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b736b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:51, skipping insertion in model container [2024-10-13 00:08:51,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:51" (3/3) ... [2024-10-13 00:08:51,480 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-97.i [2024-10-13 00:08:51,497 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:08:51,498 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:08:51,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:08:51,569 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;@5313c0db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:08:51,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:08:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:08:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 00:08:51,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:08:51,590 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:08:51,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:08:51,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:08:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2003385614, now seen corresponding path program 1 times [2024-10-13 00:08:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:08:51,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310650954] [2024-10-13 00:08:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:08:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:08:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:08:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:08:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:08:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:08:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:08:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:08:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:08:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:08:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:08:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:08:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:08:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:08:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:08:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:08:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:08:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:08:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:08:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:08:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:08:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:08:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:08:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:08:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:08:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:08:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:08:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:08:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:08:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:08:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 00:08:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:08:52,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310650954] [2024-10-13 00:08:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310650954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:08:52,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:08:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:08:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263928567] [2024-10-13 00:08:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:08:52,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:08:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:08:52,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:08:52,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:08:52,154 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:08:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:08:52,200 INFO L93 Difference]: Finished difference Result 177 states and 310 transitions. [2024-10-13 00:08:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:08:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-10-13 00:08:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:08:52,211 INFO L225 Difference]: With dead ends: 177 [2024-10-13 00:08:52,211 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 00:08:52,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-10-13 00:08:52,219 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:08:52,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:08:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 00:08:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 00:08:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:08:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-10-13 00:08:52,268 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 170 [2024-10-13 00:08:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:08:52,268 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-10-13 00:08:52,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:08:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-10-13 00:08:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 00:08:52,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:08:52,274 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:08:52,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:08:52,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:08:52,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:08:52,275 INFO L85 PathProgramCache]: Analyzing trace with hash -735295818, now seen corresponding path program 1 times [2024-10-13 00:08:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:08:52,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212402142] [2024-10-13 00:08:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:08:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:08:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:08:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:08:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:08:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:08:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:08:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:08:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:08:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:08:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:08:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:08:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:08:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:08:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:08:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:08:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:08:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:08:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:08:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:08:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:08:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:08:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:08:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:08:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:08:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:08:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:08:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:08:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:08:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:08:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 00:08:53,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:08:53,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212402142] [2024-10-13 00:08:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212402142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:08:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:08:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:08:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709732270] [2024-10-13 00:08:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:08:53,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:08:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:08:53,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:08:53,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:08:53,226 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:08:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:08:53,323 INFO L93 Difference]: Finished difference Result 174 states and 264 transitions. [2024-10-13 00:08:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:08:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-10-13 00:08:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:08:53,330 INFO L225 Difference]: With dead ends: 174 [2024-10-13 00:08:53,330 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 00:08:53,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:08:53,333 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:08:53,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 308 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:08:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 00:08:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-13 00:08:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:08:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 131 transitions. [2024-10-13 00:08:53,354 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 131 transitions. Word has length 170 [2024-10-13 00:08:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:08:53,356 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 131 transitions. [2024-10-13 00:08:53,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:08:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 131 transitions. [2024-10-13 00:08:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 00:08:53,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:08:53,362 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:08:53,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:08:53,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:08:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:08:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1261565093, now seen corresponding path program 1 times [2024-10-13 00:08:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:08:53,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202455256] [2024-10-13 00:08:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:08:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:08:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:08:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:08:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:08:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:08:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:08:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:08:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:08:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:08:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:08:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:08:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:08:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:08:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:08:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:08:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:08:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:08:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:08:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:08:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:08:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:08:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:08:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:08:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:08:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:08:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:08:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:08:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:08:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:08:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:08:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 00:08:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:08:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202455256] [2024-10-13 00:08:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202455256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:08:57,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:08:57,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 00:08:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105907125] [2024-10-13 00:08:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:08:57,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:08:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:08:57,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:08:57,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:08:57,537 INFO L87 Difference]: Start difference. First operand 87 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:08:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:08:58,823 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2024-10-13 00:08:58,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:08:58,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-13 00:08:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:08:58,828 INFO L225 Difference]: With dead ends: 269 [2024-10-13 00:08:58,830 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 00:08:58,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-13 00:08:58,832 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 219 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 00:08:58,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 552 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 00:08:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 00:08:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 102. [2024-10-13 00:08:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:08:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2024-10-13 00:08:58,852 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 172 [2024-10-13 00:08:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:08:58,853 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2024-10-13 00:08:58,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:08:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2024-10-13 00:08:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 00:08:58,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:08:58,856 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:08:58,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:08:58,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:08:58,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:08:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1003399655, now seen corresponding path program 1 times [2024-10-13 00:08:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:08:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087198480] [2024-10-13 00:08:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:08:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:08:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:09:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:09:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:09:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:09:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:09:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:09:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:09:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:09:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:09:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:09:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:09:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:09:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:09:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:09:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:09:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:09:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:09:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:09:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:09:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:09:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:09:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:09:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:09:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:09:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:09:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:09:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:09:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:09:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 00:09:01,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:09:01,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087198480] [2024-10-13 00:09:01,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087198480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:09:01,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:09:01,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 00:09:01,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479992133] [2024-10-13 00:09:01,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:09:01,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:09:01,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:09:01,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:09:01,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:09:01,160 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:09:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:09:02,250 INFO L93 Difference]: Finished difference Result 267 states and 393 transitions. [2024-10-13 00:09:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:09:02,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-13 00:09:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:09:02,257 INFO L225 Difference]: With dead ends: 267 [2024-10-13 00:09:02,257 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 00:09:02,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-13 00:09:02,259 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 121 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:09:02,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 597 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 00:09:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 00:09:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 111. [2024-10-13 00:09:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:09:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2024-10-13 00:09:02,271 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 167 transitions. Word has length 172 [2024-10-13 00:09:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:09:02,272 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 167 transitions. [2024-10-13 00:09:02,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:09:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 167 transitions. [2024-10-13 00:09:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 00:09:02,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:02,274 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:09:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:09:02,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1848371107, now seen corresponding path program 1 times [2024-10-13 00:09:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:09:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234788784] [2024-10-13 00:09:02,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:09:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:09:02,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:09:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:09:02,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:09:02,418 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:09:02,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:09:02,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:09:02,424 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 00:09:02,529 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:09:02,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:09:02 BoogieIcfgContainer [2024-10-13 00:09:02,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:09:02,533 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:09:02,533 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:09:02,533 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:09:02,534 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:51" (3/4) ... [2024-10-13 00:09:02,536 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:09:02,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:09:02,537 INFO L158 Benchmark]: Toolchain (without parser) took 12341.63ms. Allocated memory was 178.3MB in the beginning and 337.6MB in the end (delta: 159.4MB). Free memory was 109.6MB in the beginning and 113.4MB in the end (delta: -3.8MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. [2024-10-13 00:09:02,538 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:09:02,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.31ms. Allocated memory is still 178.3MB. Free memory was 109.3MB in the beginning and 149.0MB in the end (delta: -39.6MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-13 00:09:02,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.42ms. Allocated memory is still 178.3MB. Free memory was 149.0MB in the beginning and 144.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:09:02,539 INFO L158 Benchmark]: Boogie Preprocessor took 89.20ms. Allocated memory is still 178.3MB. Free memory was 143.6MB in the beginning and 137.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:09:02,539 INFO L158 Benchmark]: RCFGBuilder took 694.39ms. Allocated memory is still 178.3MB. Free memory was 137.3MB in the beginning and 105.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 00:09:02,539 INFO L158 Benchmark]: TraceAbstraction took 11059.26ms. Allocated memory was 178.3MB in the beginning and 337.6MB in the end (delta: 159.4MB). Free memory was 105.2MB in the beginning and 113.4MB in the end (delta: -8.2MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. [2024-10-13 00:09:02,540 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 337.6MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:09:02,541 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.18ms. Allocated memory is still 113.2MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.31ms. Allocated memory is still 178.3MB. Free memory was 109.3MB in the beginning and 149.0MB in the end (delta: -39.6MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.42ms. Allocated memory is still 178.3MB. Free memory was 149.0MB in the beginning and 144.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.20ms. Allocated memory is still 178.3MB. Free memory was 143.6MB in the beginning and 137.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 694.39ms. Allocated memory is still 178.3MB. Free memory was 137.3MB in the beginning and 105.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11059.26ms. Allocated memory was 178.3MB in the beginning and 337.6MB in the end (delta: 159.4MB). Free memory was 105.2MB in the beginning and 113.4MB in the end (delta: -8.2MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 337.6MB. Free memory is still 113.4MB. 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 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 32; [L25] unsigned char var_1_4 = 1; [L26] signed long int var_1_5 = 5; [L27] signed long int var_1_6 = 2; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] float var_1_9 = 128.6; [L31] float var_1_10 = 32.5; [L32] unsigned char var_1_11 = 16; [L33] unsigned char var_1_12 = 64; [L34] unsigned char var_1_13 = 4; [L35] unsigned char var_1_14 = 4; [L36] unsigned long int var_1_15 = 0; [L37] signed short int var_1_16 = 0; [L38] signed char var_1_17 = 1; [L39] signed char var_1_18 = -1; [L40] signed char var_1_19 = 0; [L41] signed long int var_1_20 = -64; [L42] signed long int var_1_21 = 25; [L43] unsigned char var_1_22 = 0; [L44] unsigned char var_1_23 = 0; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L94] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L94] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L95] var_1_3 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L97] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L97] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L101] var_1_6 = __VERIFIER_nondet_long() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L106] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L106] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L107] var_1_9 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L108] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L109] var_1_10 = __VERIFIER_nondet_float() [L110] 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=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L110] 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=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L112] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L115] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L123] var_1_18 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L124] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L126] var_1_19 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L127] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L129] var_1_21 = __VERIFIER_nondet_long() [L130] CALL assume_abort_if_not(var_1_21 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L130] RET assume_abort_if_not(var_1_21 >= -2147483647) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L132] var_1_23 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L133] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L147] RET updateVariables() [L148] CALL step() [L48] COND FALSE !((var_1_2 + var_1_3) < -200) [L59] var_1_1 = var_1_2 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L61] COND TRUE 256 > (var_1_3 - (var_1_2 + var_1_6)) [L62] var_1_5 = var_1_2 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L72] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L75] COND TRUE \read(var_1_7) [L76] var_1_15 = var_1_6 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L78] var_1_16 = (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L79] COND FALSE !(\read(var_1_4)) [L86] var_1_17 = -32 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L88] var_1_20 = var_1_21 [L89] var_1_22 = var_1_23 [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139-L140] return (((((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 5, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 1585 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1122 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 463 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 137 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 680 ConstructedInterpolants, 0 QuantifiedInterpolants, 5897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6048/6048 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-10-13 00:09:02,588 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_normal_file-97.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 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:09:04,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:09:05,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:09:05,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:09:05,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:09:05,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:09:05,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:09:05,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:09:05,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:09:05,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:09:05,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:09:05,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:09:05,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:09:05,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:09:05,073 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:09:05,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:09:05,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:09:05,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:09:05,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:09:05,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:09:05,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:09:05,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:09:05,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:09:05,081 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:09:05,082 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:09:05,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:09:05,082 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:09:05,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:09:05,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:09:05,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:09:05,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:09:05,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:09:05,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:09:05,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:09:05,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:09:05,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:09:05,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:09:05,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:09:05,089 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:09:05,089 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:09:05,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:09:05,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:09:05,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:09:05,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:09:05,091 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:09:05,091 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 -> 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c [2024-10-13 00:09:05,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:09:05,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:09:05,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:09:05,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:09:05,488 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:09:05,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-10-13 00:09:07,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:09:07,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:09:07,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-10-13 00:09:07,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c5cabaa/268fcbab8ab74b33adad84fa837ecfb8/FLAGb5585fa3a [2024-10-13 00:09:07,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c5cabaa/268fcbab8ab74b33adad84fa837ecfb8 [2024-10-13 00:09:07,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:09:07,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:09:07,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:09:07,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:09:07,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:09:07,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ca8310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07, skipping insertion in model container [2024-10-13 00:09:07,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:09:07,575 WARN L248 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_normal_file-97.i[913,926] [2024-10-13 00:09:07,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:09:07,682 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:09:07,696 WARN L248 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_normal_file-97.i[913,926] [2024-10-13 00:09:07,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:09:07,760 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:09:07,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07 WrapperNode [2024-10-13 00:09:07,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:09:07,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:09:07,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:09:07,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:09:07,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,820 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-10-13 00:09:07,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:09:07,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:09:07,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:09:07,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:09:07,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,859 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-10-13 00:09:07,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:09:07,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:09:07,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:09:07,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:09:07,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (1/1) ... [2024-10-13 00:09:07,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:09:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:09:07,919 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-10-13 00:09:07,921 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-10-13 00:09:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:09:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:09:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:09:07,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:09:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:09:07,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:09:08,061 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:09:08,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:09:08,460 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 00:09:08,460 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:09:08,542 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:09:08,542 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:09:08,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:08 BoogieIcfgContainer [2024-10-13 00:09:08,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:09:08,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:09:08,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:09:08,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:09:08,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:09:07" (1/3) ... [2024-10-13 00:09:08,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65968f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:08, skipping insertion in model container [2024-10-13 00:09:08,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:07" (2/3) ... [2024-10-13 00:09:08,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65968f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:08, skipping insertion in model container [2024-10-13 00:09:08,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:08" (3/3) ... [2024-10-13 00:09:08,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-97.i [2024-10-13 00:09:08,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:09:08,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:09:08,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:09:08,660 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;@228b9499, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:09:08,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:09:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:09:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 00:09:08,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:08,684 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:09:08,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:08,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:08,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1755704202, now seen corresponding path program 1 times [2024-10-13 00:09:08,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:09:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218678279] [2024-10-13 00:09:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:08,709 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-10-13 00:09:08,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:09:08,713 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-10-13 00:09:08,715 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-10-13 00:09:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:08,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:09:08,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:09:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-13 00:09:09,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:09:09,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:09:09,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218678279] [2024-10-13 00:09:09,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218678279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:09:09,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:09:09,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:09:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851132248] [2024-10-13 00:09:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:09:09,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:09:09,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:09:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:09:09,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:09:09,069 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:09:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:09:09,126 INFO L93 Difference]: Finished difference Result 129 states and 236 transitions. [2024-10-13 00:09:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:09:09,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 166 [2024-10-13 00:09:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:09:09,140 INFO L225 Difference]: With dead ends: 129 [2024-10-13 00:09:09,140 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 00:09:09,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-10-13 00:09:09,152 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:09:09,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:09:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 00:09:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 00:09:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:09:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-13 00:09:09,206 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 166 [2024-10-13 00:09:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:09:09,206 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-13 00:09:09,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:09:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-13 00:09:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 00:09:09,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:09,213 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:09:09,223 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-10-13 00:09:09,414 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-10-13 00:09:09,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:09,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -33820338, now seen corresponding path program 1 times [2024-10-13 00:09:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:09:09,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040657691] [2024-10-13 00:09:09,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:09,417 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-10-13 00:09:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:09:09,422 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-10-13 00:09:09,423 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-10-13 00:09:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:09,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 00:09:09,823 INFO L278 TraceCheckSpWp]: Computing forward predicates...