./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.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 235ed319bc52a68655347e756e6c00f5033f8cd4f7805979bed7b6dfee48c5d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:38:37,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:38:37,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:38:37,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:38:37,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:38:37,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:38:37,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:38:37,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:38:37,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:38:37,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:38:37,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:38:37,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:38:37,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:38:37,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:38:37,279 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:38:37,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:38:37,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:38:37,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:38:37,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:38:37,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:38:37,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:38:37,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:38:37,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:38:37,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:38:37,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:38:37,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:38:37,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:38:37,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:38:37,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:38:37,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:38:37,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:38:37,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:38:37,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:38:37,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:38:37,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:38:37,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:38:37,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:38:37,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:38:37,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:38:37,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:38:37,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:38:37,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:38:37,287 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 -> 235ed319bc52a68655347e756e6c00f5033f8cd4f7805979bed7b6dfee48c5d5 [2024-11-16 16:38:37,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:38:37,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:38:37,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:38:37,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:38:37,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:38:37,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-16 16:38:38,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:38:38,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:38:38,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-16 16:38:38,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db53d3574/27850145aebf43c3abe893ffa3b500cd/FLAG98c80b029 [2024-11-16 16:38:39,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db53d3574/27850145aebf43c3abe893ffa3b500cd [2024-11-16 16:38:39,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:38:39,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:38:39,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:38:39,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:38:39,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:38:39,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dde43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39, skipping insertion in model container [2024-11-16 16:38:39,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:38:39,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i[915,928] [2024-11-16 16:38:39,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:38:39,551 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:38:39,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i[915,928] [2024-11-16 16:38:39,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:38:39,594 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:38:39,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39 WrapperNode [2024-11-16 16:38:39,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:38:39,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:38:39,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:38:39,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:38:39,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,628 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-16 16:38:39,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:38:39,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:38:39,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:38:39,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:38:39,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,651 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:38:39,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:38:39,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:38:39,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:38:39,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:38:39,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (1/1) ... [2024-11-16 16:38:39,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:38:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:38:39,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:38:39,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:38:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:38:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:38:39,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:38:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:38:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:38:39,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:38:39,802 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:38:39,803 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:38:40,000 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 16:38:40,000 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:38:40,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:38:40,011 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:38:40,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:40 BoogieIcfgContainer [2024-11-16 16:38:40,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:38:40,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:38:40,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:38:40,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:38:40,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:38:39" (1/3) ... [2024-11-16 16:38:40,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcc693c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:38:40, skipping insertion in model container [2024-11-16 16:38:40,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:39" (2/3) ... [2024-11-16 16:38:40,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcc693c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:38:40, skipping insertion in model container [2024-11-16 16:38:40,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:40" (3/3) ... [2024-11-16 16:38:40,018 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-16 16:38:40,030 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:38:40,031 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:38:40,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:38:40,083 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;@26323d07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:38:40,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:38:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 16:38:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 16:38:40,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:40,095 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:40,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:40,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1270636157, now seen corresponding path program 1 times [2024-11-16 16:38:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:38:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729844277] [2024-11-16 16:38:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:40,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:38:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:38:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:38:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:38:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:38:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:38:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:38:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:38:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:38:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:38:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:38:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:38:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:38:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:38:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:38:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:38:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:38:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:38:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 16:38:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 16:38:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 16:38:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 16:38:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 16:38:40,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:38:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729844277] [2024-11-16 16:38:40,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729844277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:38:40,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:38:40,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:38:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120157932] [2024-11-16 16:38:40,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:38:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:38:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:38:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:38:40,439 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 16:38:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:40,458 INFO L93 Difference]: Finished difference Result 116 states and 196 transitions. [2024-11-16 16:38:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:38:40,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2024-11-16 16:38:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:40,465 INFO L225 Difference]: With dead ends: 116 [2024-11-16 16:38:40,465 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 16:38:40,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:38:40,470 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:40,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:38:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 16:38:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-16 16:38:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 16:38:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2024-11-16 16:38:40,506 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 132 [2024-11-16 16:38:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:40,507 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2024-11-16 16:38:40,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 16:38:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2024-11-16 16:38:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 16:38:40,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:40,510 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:40,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:38:40,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:40,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1686682202, now seen corresponding path program 1 times [2024-11-16 16:38:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:38:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358110896] [2024-11-16 16:38:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:38:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:38:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:38:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:38:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:38:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:38:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:38:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:38:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:38:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:38:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:38:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:38:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:38:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:38:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:38:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:38:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:38:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:38:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 16:38:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 16:38:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 16:38:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 16:38:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 16:38:40,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:38:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358110896] [2024-11-16 16:38:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358110896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:38:40,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:38:40,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:38:40,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570572040] [2024-11-16 16:38:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:40,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:38:40,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:38:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:38:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:38:40,882 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 16:38:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:40,939 INFO L93 Difference]: Finished difference Result 165 states and 243 transitions. [2024-11-16 16:38:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:38:40,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-16 16:38:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:40,943 INFO L225 Difference]: With dead ends: 165 [2024-11-16 16:38:40,944 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 16:38:40,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:38:40,946 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 39 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:40,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 151 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:38:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 16:38:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-16 16:38:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 16:38:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2024-11-16 16:38:40,965 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 132 [2024-11-16 16:38:40,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:40,966 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2024-11-16 16:38:40,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 16:38:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2024-11-16 16:38:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 16:38:40,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:40,968 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:40,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:38:40,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:40,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash 56128133, now seen corresponding path program 1 times [2024-11-16 16:38:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:38:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867688856] [2024-11-16 16:38:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:38:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:38:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385471237] [2024-11-16 16:38:41,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:41,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:38:41,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:38:41,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:38:41,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 16:38:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:38:41,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:38:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:38:41,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:38:41,265 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:38:41,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:38:41,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 16:38:41,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:38:41,471 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 16:38:41,545 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:38:41,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:38:41 BoogieIcfgContainer [2024-11-16 16:38:41,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:38:41,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:38:41,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:38:41,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:38:41,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:40" (3/4) ... [2024-11-16 16:38:41,551 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:38:41,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:38:41,553 INFO L158 Benchmark]: Toolchain (without parser) took 2217.47ms. Allocated memory was 174.1MB in the beginning and 230.7MB in the end (delta: 56.6MB). Free memory was 119.7MB in the beginning and 152.9MB in the end (delta: -33.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-11-16 16:38:41,553 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:38:41,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.38ms. Allocated memory is still 174.1MB. Free memory was 119.4MB in the beginning and 105.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 16:38:41,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.75ms. Allocated memory is still 174.1MB. Free memory was 105.0MB in the beginning and 102.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:38:41,554 INFO L158 Benchmark]: Boogie Preprocessor took 31.58ms. Allocated memory is still 174.1MB. Free memory was 102.4MB in the beginning and 99.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:38:41,554 INFO L158 Benchmark]: IcfgBuilder took 347.24ms. Allocated memory is still 174.1MB. Free memory was 99.4MB in the beginning and 82.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 16:38:41,554 INFO L158 Benchmark]: TraceAbstraction took 1534.25ms. Allocated memory was 174.1MB in the beginning and 230.7MB in the end (delta: 56.6MB). Free memory was 81.4MB in the beginning and 154.0MB in the end (delta: -72.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:38:41,555 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 230.7MB. Free memory was 154.0MB in the beginning and 152.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:38:41,556 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.16ms. Allocated memory is still 174.1MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.38ms. Allocated memory is still 174.1MB. Free memory was 119.4MB in the beginning and 105.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.75ms. Allocated memory is still 174.1MB. Free memory was 105.0MB in the beginning and 102.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.58ms. Allocated memory is still 174.1MB. Free memory was 102.4MB in the beginning and 99.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 347.24ms. Allocated memory is still 174.1MB. Free memory was 99.4MB in the beginning and 82.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1534.25ms. Allocated memory was 174.1MB in the beginning and 230.7MB in the end (delta: 56.6MB). Free memory was 81.4MB in the beginning and 154.0MB in the end (delta: -72.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 230.7MB. Free memory was 154.0MB in the beginning and 152.9MB in the end (delta: 1.0MB). 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 106, overapproximation of someBinaryArithmeticFLOAToperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 1; [L31] float var_1_10 = 0.125; [L32] signed long int var_1_11 = 50; [L33] float var_1_12 = 1000000000000.45; [L34] float var_1_13 = 128.5; [L35] float var_1_14 = 10000000.625; [L36] signed char var_1_15 = -5; [L37] signed char var_1_16 = 10; VAL [isInitial=0, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L73] var_1_3 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L74] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L76] var_1_4 = __VERIFIER_nondet_ushort() [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=1, var_1_8=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=1, var_1_8=1, var_1_9=1] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_8=1, var_1_9=1] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_8=1, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=1, var_1_9=1] [L85] var_1_8 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L88] var_1_9 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L91] var_1_11 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L99] var_1_16 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L114] RET updateVariables() [L115] CALL step() [L41] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=256, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L42] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=256, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L47] var_1_14 = var_1_12 [L48] var_1_15 = var_1_16 VAL [isInitial=1, stepLocal_0=256, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L49] COND FALSE !(! var_1_5) [L52] var_1_1 = var_1_4 VAL [isInitial=1, stepLocal_0=256, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L54] signed long int stepLocal_1 = -2 / var_1_11; VAL [isInitial=1, stepLocal_0=256, stepLocal_1=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L55] COND TRUE stepLocal_1 > (((((var_1_4) > (var_1_3)) ? (var_1_4) : (var_1_3))) * var_1_1) [L56] var_1_10 = ((var_1_12 - var_1_13) + 9.8f) VAL [isInitial=1, stepLocal_0=256, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((((! var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && (var_1_7 || var_1_8)) ? (var_1_5 == ((unsigned char) var_1_9)) : 1) : 1)) && (((-2 / var_1_11) > (((((var_1_4) > (var_1_3)) ? (var_1_4) : (var_1_3))) * var_1_1)) ? (var_1_10 == ((float) ((var_1_12 - var_1_13) + 9.8f))) : (var_1_5 ? (var_1_5 ? (var_1_10 == ((float) var_1_12)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_12))))) && (var_1_14 == ((float) var_1_12))) && (var_1_15 == ((signed char) var_1_16)) ; VAL [\result=0, isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 234 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 162 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 528 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 16:38:41,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.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 235ed319bc52a68655347e756e6c00f5033f8cd4f7805979bed7b6dfee48c5d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:38:43,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:38:43,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:38:43,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:38:43,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:38:43,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:38:43,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:38:43,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:38:43,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:38:43,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:38:43,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:38:43,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:38:43,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:38:43,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:38:43,448 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:38:43,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:38:43,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:38:43,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:38:43,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:38:43,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:38:43,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:38:43,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:38:43,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:38:43,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:38:43,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:38:43,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:38:43,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:38:43,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:38:43,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:38:43,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:38:43,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:38:43,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:38:43,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:38:43,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:38:43,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:38:43,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:38:43,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:38:43,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:38:43,454 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:38:43,455 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:38:43,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:38:43,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:38:43,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:38:43,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:38:43,456 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 -> 235ed319bc52a68655347e756e6c00f5033f8cd4f7805979bed7b6dfee48c5d5 [2024-11-16 16:38:43,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:38:43,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:38:43,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:38:43,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:38:43,733 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:38:43,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-16 16:38:45,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:38:45,193 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:38:45,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-16 16:38:45,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816a47754/06fcdca60c6a4457bee432c4cc3e894e/FLAG0cb6bdd38 [2024-11-16 16:38:45,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816a47754/06fcdca60c6a4457bee432c4cc3e894e [2024-11-16 16:38:45,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:38:45,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:38:45,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:38:45,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:38:45,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:38:45,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f632ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45, skipping insertion in model container [2024-11-16 16:38:45,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:38:45,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i[915,928] [2024-11-16 16:38:45,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:38:45,853 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:38:45,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i[915,928] [2024-11-16 16:38:45,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:38:45,906 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:38:45,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45 WrapperNode [2024-11-16 16:38:45,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:38:45,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:38:45,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:38:45,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:38:45,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,944 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 16:38:45,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:38:45,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:38:45,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:38:45,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:38:45,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,975 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:38:45,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:45,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:38:45,998 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:38:45,998 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:38:45,998 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:38:45,999 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (1/1) ... [2024-11-16 16:38:46,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:38:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:38:46,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:38:46,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:38:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:38:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:38:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:38:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:38:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:38:46,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:38:46,126 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:38:46,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:38:46,705 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 16:38:46,705 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:38:46,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:38:46,719 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:38:46,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:46 BoogieIcfgContainer [2024-11-16 16:38:46,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:38:46,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:38:46,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:38:46,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:38:46,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:38:45" (1/3) ... [2024-11-16 16:38:46,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db79586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:38:46, skipping insertion in model container [2024-11-16 16:38:46,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:45" (2/3) ... [2024-11-16 16:38:46,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db79586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:38:46, skipping insertion in model container [2024-11-16 16:38:46,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:46" (3/3) ... [2024-11-16 16:38:46,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-16 16:38:46,740 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:38:46,740 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:38:46,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:38:46,797 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;@4c76076b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:38:46,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:38:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 16:38:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 16:38:46,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:46,827 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:46,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1270636157, now seen corresponding path program 1 times [2024-11-16 16:38:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:38:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663531074] [2024-11-16 16:38:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:46,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:38:46,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:38:46,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:38:46,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 16:38:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:47,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:38:47,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:38:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-16 16:38:47,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:38:47,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:38:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663531074] [2024-11-16 16:38:47,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663531074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:38:47,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:38:47,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:38:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449088041] [2024-11-16 16:38:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:47,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:38:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:38:47,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:38:47,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:38:47,126 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 16:38:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:47,144 INFO L93 Difference]: Finished difference Result 116 states and 196 transitions. [2024-11-16 16:38:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:38:47,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2024-11-16 16:38:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:47,152 INFO L225 Difference]: With dead ends: 116 [2024-11-16 16:38:47,153 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 16:38:47,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:38:47,159 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:47,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:38:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 16:38:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-16 16:38:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 16:38:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2024-11-16 16:38:47,190 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 132 [2024-11-16 16:38:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2024-11-16 16:38:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 16:38:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2024-11-16 16:38:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 16:38:47,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:47,194 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:47,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:38:47,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:38:47,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:47,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1686682202, now seen corresponding path program 1 times [2024-11-16 16:38:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:38:47,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704525325] [2024-11-16 16:38:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:47,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:38:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:38:47,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:38:47,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 16:38:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:47,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 16:38:47,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:38:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 16:38:47,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:38:47,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:38:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704525325] [2024-11-16 16:38:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704525325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:38:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:38:47,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:38:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471334028] [2024-11-16 16:38:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:47,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:38:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:38:47,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:38:47,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:38:47,897 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 16:38:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:48,368 INFO L93 Difference]: Finished difference Result 165 states and 243 transitions. [2024-11-16 16:38:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:38:48,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-16 16:38:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:48,372 INFO L225 Difference]: With dead ends: 165 [2024-11-16 16:38:48,372 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 16:38:48,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:38:48,374 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:48,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 151 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 16:38:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 16:38:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-16 16:38:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 16:38:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2024-11-16 16:38:48,395 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 132 [2024-11-16 16:38:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:48,396 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2024-11-16 16:38:48,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 16:38:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2024-11-16 16:38:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 16:38:48,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:48,398 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:48,408 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-16 16:38:48,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:38:48,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:48,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 56128133, now seen corresponding path program 1 times [2024-11-16 16:38:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:38:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427944860] [2024-11-16 16:38:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:48,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:38:48,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:38:48,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:38:48,603 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 (4)] Waiting until timeout for monitored process [2024-11-16 16:38:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:48,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 16:38:48,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:39:06,320 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)