./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.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 849083912b26b4b30248ff5689bdb4cde8d919d90edb130c279b0f61a6bab9d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:56:45,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:56:46,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:56:46,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:56:46,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:56:46,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:56:46,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:56:46,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:56:46,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:56:46,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:56:46,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:56:46,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:56:46,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:56:46,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:56:46,112 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:56:46,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:56:46,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:56:46,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:56:46,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:56:46,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:56:46,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:56:46,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:56:46,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:56:46,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:56:46,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:56:46,118 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:56:46,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:56:46,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:56:46,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:56:46,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:56:46,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:56:46,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:56:46,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:56:46,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:56:46,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:56:46,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:56:46,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:56:46,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:56:46,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:56:46,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:56:46,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:56:46,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:56:46,122 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 -> 849083912b26b4b30248ff5689bdb4cde8d919d90edb130c279b0f61a6bab9d5 [2024-11-20 05:56:46,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:56:46,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:56:46,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:56:46,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:56:46,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:56:46,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.i [2024-11-20 05:56:47,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:56:48,178 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:56:48,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.i [2024-11-20 05:56:48,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8db6f2d5/650d1bcb42094293b64d62e16d52dfde/FLAGe7f687a83 [2024-11-20 05:56:48,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8db6f2d5/650d1bcb42094293b64d62e16d52dfde [2024-11-20 05:56:48,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:56:48,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:56:48,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:56:48,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:56:48,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:56:48,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:48,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cbdfb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48, skipping insertion in model container [2024-11-20 05:56:48,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:48,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:56:48,752 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_floatingpointinfluence_has-floats_file-82.i[917,930] [2024-11-20 05:56:48,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:56:48,831 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:56:48,872 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_floatingpointinfluence_has-floats_file-82.i[917,930] [2024-11-20 05:56:48,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:56:48,966 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:56:48,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48 WrapperNode [2024-11-20 05:56:48,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:56:48,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:56:48,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:56:48,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:56:48,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:48,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,022 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-20 05:56:49,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:56:49,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:56:49,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:56:49,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:56:49,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:56:49,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:56:49,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:56:49,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:56:49,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:56:49,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (1/1) ... [2024-11-20 05:56:49,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:56:49,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:56:49,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:56:49,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:56:49,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:56:49,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:56:49,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:56:49,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:56:49,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:56:49,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:56:49,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:56:49,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:56:49,620 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 05:56:49,620 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:56:49,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:56:49,640 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:56:49,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:49 BoogieIcfgContainer [2024-11-20 05:56:49,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:56:49,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:56:49,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:56:49,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:56:49,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:56:48" (1/3) ... [2024-11-20 05:56:49,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df6f0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:56:49, skipping insertion in model container [2024-11-20 05:56:49,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:48" (2/3) ... [2024-11-20 05:56:49,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df6f0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:56:49, skipping insertion in model container [2024-11-20 05:56:49,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:49" (3/3) ... [2024-11-20 05:56:49,654 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-82.i [2024-11-20 05:56:49,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:56:49,669 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:56:49,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:56:49,734 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;@37b1bc4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:56:49,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:56:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 05:56:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 05:56:49,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:49,748 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:56:49,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:56:49,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:56:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1911187605, now seen corresponding path program 1 times [2024-11-20 05:56:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:56:49,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283587236] [2024-11-20 05:56:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:56:49,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:56:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:56:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:56:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:56:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:56:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:56:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:56:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:56:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:56:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:56:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:56:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:56:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:56:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:56:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:56:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 05:56:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:56:50,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283587236] [2024-11-20 05:56:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283587236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:56:50,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:56:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:56:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903678796] [2024-11-20 05:56:50,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:56:50,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:56:50,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:56:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:56:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:56:50,196 INFO L87 Difference]: Start difference. First operand has 58 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 05:56:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:56:50,228 INFO L93 Difference]: Finished difference Result 109 states and 178 transitions. [2024-11-20 05:56:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:56:50,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2024-11-20 05:56:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:56:50,237 INFO L225 Difference]: With dead ends: 109 [2024-11-20 05:56:50,238 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 05:56:50,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:56:50,245 INFO L432 NwaCegarLoop]: 78 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, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:56:50,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:56:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 05:56:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-20 05:56:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 05:56:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-20 05:56:50,292 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 95 [2024-11-20 05:56:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:56:50,293 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-20 05:56:50,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 05:56:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-20 05:56:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 05:56:50,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:50,302 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:56:50,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:56:50,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:56:50,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:56:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash 350077977, now seen corresponding path program 1 times [2024-11-20 05:56:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:56:50,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569619022] [2024-11-20 05:56:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:56:50,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:56:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:56:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:56:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:56:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:56:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:56:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:56:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:56:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:56:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:56:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:56:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:56:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:56:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:56:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:56:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 05:56:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:56:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569619022] [2024-11-20 05:56:50,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569619022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:56:50,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:56:50,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:56:50,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948521872] [2024-11-20 05:56:50,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:56:50,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:56:50,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:56:50,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:56:50,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:56:50,742 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 05:56:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:56:50,809 INFO L93 Difference]: Finished difference Result 123 states and 177 transitions. [2024-11-20 05:56:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:56:50,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-20 05:56:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:56:50,812 INFO L225 Difference]: With dead ends: 123 [2024-11-20 05:56:50,812 INFO L226 Difference]: Without dead ends: 72 [2024-11-20 05:56:50,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:56:50,814 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 21 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:56:50,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 207 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:56:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-20 05:56:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2024-11-20 05:56:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 05:56:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2024-11-20 05:56:50,826 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 95 [2024-11-20 05:56:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:56:50,829 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2024-11-20 05:56:50,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 05:56:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2024-11-20 05:56:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 05:56:50,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:50,834 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:56:50,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:56:50,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:56:50,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:56:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 583334100, now seen corresponding path program 1 times [2024-11-20 05:56:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:56:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062864320] [2024-11-20 05:56:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:56:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:56:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:56:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:56:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:56:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:56:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:56:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:56:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:56:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:56:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:56:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:56:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:56:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:56:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:56:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:56:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 05:56:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:56:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062864320] [2024-11-20 05:56:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062864320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:56:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:56:51,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 05:56:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125266461] [2024-11-20 05:56:51,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:56:51,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 05:56:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:56:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 05:56:51,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:56:51,242 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 05:56:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:56:51,513 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2024-11-20 05:56:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:56:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-20 05:56:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:56:51,517 INFO L225 Difference]: With dead ends: 181 [2024-11-20 05:56:51,517 INFO L226 Difference]: Without dead ends: 126 [2024-11-20 05:56:51,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:56:51,519 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:56:51,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 280 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:56:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-20 05:56:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2024-11-20 05:56:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 05:56:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-11-20 05:56:51,547 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 97 [2024-11-20 05:56:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:56:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-11-20 05:56:51,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 05:56:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-11-20 05:56:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 05:56:51,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:51,550 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:56:51,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:56:51,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:56:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:56:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 841499538, now seen corresponding path program 1 times [2024-11-20 05:56:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:56:51,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897481747] [2024-11-20 05:56:51,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:56:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:56:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:56:51,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:56:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:56:51,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:56:51,683 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:56:51,684 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:56:51,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:56:51,691 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 05:56:51,786 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:56:51,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:56:51 BoogieIcfgContainer [2024-11-20 05:56:51,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:56:51,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:56:51,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:56:51,791 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:56:51,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:49" (3/4) ... [2024-11-20 05:56:51,795 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:56:51,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:56:51,798 INFO L158 Benchmark]: Toolchain (without parser) took 3246.32ms. Allocated memory is still 172.0MB. Free memory was 114.8MB in the beginning and 87.9MB in the end (delta: 26.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-20 05:56:51,798 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:56:51,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.22ms. Allocated memory is still 172.0MB. Free memory was 114.8MB in the beginning and 142.3MB in the end (delta: -27.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:56:51,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.65ms. Allocated memory is still 172.0MB. Free memory was 141.5MB in the beginning and 138.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:56:51,801 INFO L158 Benchmark]: Boogie Preprocessor took 101.38ms. Allocated memory is still 172.0MB. Free memory was 138.1MB in the beginning and 133.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:56:51,801 INFO L158 Benchmark]: RCFGBuilder took 514.76ms. Allocated memory is still 172.0MB. Free memory was 133.1MB in the beginning and 112.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 05:56:51,801 INFO L158 Benchmark]: TraceAbstraction took 2147.40ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 89.0MB in the end (delta: 22.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-11-20 05:56:51,802 INFO L158 Benchmark]: Witness Printer took 5.45ms. Allocated memory is still 172.0MB. Free memory was 89.0MB in the beginning and 87.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:56:51,808 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.22ms. Allocated memory is still 172.0MB. Free memory was 114.8MB in the beginning and 142.3MB in the end (delta: -27.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.65ms. Allocated memory is still 172.0MB. Free memory was 141.5MB in the beginning and 138.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.38ms. Allocated memory is still 172.0MB. Free memory was 138.1MB in the beginning and 133.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 514.76ms. Allocated memory is still 172.0MB. Free memory was 133.1MB in the beginning and 112.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2147.40ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 89.0MB in the end (delta: 22.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Witness Printer took 5.45ms. Allocated memory is still 172.0MB. Free memory was 89.0MB in the beginning and 87.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 128.75; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 63.5; [L25] float var_1_4 = 255.5; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_9 = 25; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 16; [L30] unsigned char var_1_12 = 2; [L31] unsigned char var_1_14 = 5; [L32] unsigned char var_1_15 = 10; [L33] double var_1_16 = 3.75; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 255.5; [L36] unsigned char last_1_var_1_5 = 32; [L37] unsigned char last_1_var_1_12 = 2; [L38] unsigned char last_1_var_1_17 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L94] last_1_var_1_5 = var_1_5 [L95] last_1_var_1_12 = var_1_12 [L96] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L106] RET updateLastVariables() [L107] 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, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L73] var_1_3 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L75] var_1_4 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L81] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L85] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L85] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L86] var_1_14 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L88] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L88] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L91] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L91] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L107] RET updateVariables() [L108] CALL step() [L42] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L42] signed long int stepLocal_0 = last_1_var_1_17 | last_1_var_1_12; [L43] COND FALSE !((last_1_var_1_5 / -2) >= stepLocal_0) [L46] var_1_5 = (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=0, var_1_9=128] [L48] COND FALSE !(! var_1_2) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=0, var_1_9=128] [L53] var_1_16 = var_1_4 [L54] var_1_17 = var_1_9 [L55] var_1_18 = var_1_3 [L56] unsigned char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, stepLocal_1=128, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=127, var_1_15=127, var_1_16=261, var_1_17=128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=128] [L57] COND FALSE !((var_1_5 + var_1_11) >= stepLocal_1) [L66] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=128, var_1_14=127, var_1_15=127, var_1_16=261, var_1_17=128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=128] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=128, var_1_14=127, var_1_15=127, var_1_16=261, var_1_17=128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=128] [L99] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=128, var_1_14=127, var_1_15=127, var_1_16=261, var_1_17=128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=128] [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=128, var_1_14=127, var_1_15=127, var_1_16=261, var_1_17=128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=128] [L99-L100] return ((((((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) && (((var_1_5 + var_1_11) >= var_1_9) ? ((((((var_1_4) > ((var_1_1 * var_1_3))) ? (var_1_4) : ((var_1_1 * var_1_3)))) <= var_1_1) ? (var_1_12 == ((unsigned char) ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))))) : (var_1_2 ? (var_1_12 == ((unsigned char) (var_1_11 + var_1_15))) : 1)) : (var_1_12 == ((unsigned char) var_1_9)))) && (var_1_16 == ((double) var_1_4))) && (var_1_17 == ((unsigned char) var_1_9))) && (var_1_18 == ((double) var_1_3)) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=128, var_1_14=127, var_1_15=127, var_1_16=261, var_1_17=128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=128, var_1_14=127, var_1_15=127, var_1_16=261, var_1_17=128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 565 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 225 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 05:56:51,840 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.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 849083912b26b4b30248ff5689bdb4cde8d919d90edb130c279b0f61a6bab9d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:56:54,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:56:54,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:56:54,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:56:54,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:56:54,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:56:54,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:56:54,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:56:54,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:56:54,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:56:54,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:56:54,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:56:54,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:56:54,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:56:54,273 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:56:54,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:56:54,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:56:54,275 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:56:54,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:56:54,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:56:54,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:56:54,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:56:54,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:56:54,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:56:54,279 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:56:54,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:56:54,280 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:56:54,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:56:54,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:56:54,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:56:54,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:56:54,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:56:54,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:56:54,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:56:54,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:56:54,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:56:54,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:56:54,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:56:54,284 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:56:54,285 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:56:54,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:56:54,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:56:54,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:56:54,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:56:54,286 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 -> 849083912b26b4b30248ff5689bdb4cde8d919d90edb130c279b0f61a6bab9d5 [2024-11-20 05:56:54,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:56:54,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:56:54,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:56:54,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:56:54,650 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:56:54,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.i [2024-11-20 05:56:56,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:56:56,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:56:56,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.i [2024-11-20 05:56:56,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1286072fa/57371021bf9643edb5de1d437c36931c/FLAG20f91e735 [2024-11-20 05:56:56,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1286072fa/57371021bf9643edb5de1d437c36931c [2024-11-20 05:56:56,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:56:56,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:56:56,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:56:56,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:56:56,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:56:56,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b88c6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56, skipping insertion in model container [2024-11-20 05:56:56,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:56:56,742 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_floatingpointinfluence_has-floats_file-82.i[917,930] [2024-11-20 05:56:56,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:56:56,825 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:56:56,837 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_floatingpointinfluence_has-floats_file-82.i[917,930] [2024-11-20 05:56:56,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:56:56,891 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:56:56,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56 WrapperNode [2024-11-20 05:56:56,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:56:56,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:56:56,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:56:56,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:56:56,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,949 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-11-20 05:56:56,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:56:56,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:56:56,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:56:56,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:56:56,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,986 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:56:56,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:56,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:57,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:57,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:57,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:57,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:56:57,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:56:57,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:56:57,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:56:57,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (1/1) ... [2024-11-20 05:56:57,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:56:57,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:56:57,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:56:57,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:56:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:56:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:56:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:56:57,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:56:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:56:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:56:57,206 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:56:57,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:56:59,294 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 05:56:59,294 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:56:59,309 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:56:59,309 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:56:59,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:59 BoogieIcfgContainer [2024-11-20 05:56:59,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:56:59,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:56:59,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:56:59,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:56:59,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:56:56" (1/3) ... [2024-11-20 05:56:59,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87beb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:56:59, skipping insertion in model container [2024-11-20 05:56:59,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:56" (2/3) ... [2024-11-20 05:56:59,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87beb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:56:59, skipping insertion in model container [2024-11-20 05:56:59,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:59" (3/3) ... [2024-11-20 05:56:59,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-82.i [2024-11-20 05:56:59,336 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:56:59,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:56:59,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:56:59,394 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;@5c2cc6e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:56:59,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:56:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 05:56:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 05:56:59,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:59,410 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:56:59,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:56:59,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:56:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 765478487, now seen corresponding path program 1 times [2024-11-20 05:56:59,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:56:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10852069] [2024-11-20 05:56:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:56:59,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:56:59,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:56:59,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:56:59,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 05:56:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:59,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:56:59,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:56:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-20 05:56:59,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:56:59,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:56:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10852069] [2024-11-20 05:56:59,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10852069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:56:59,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:56:59,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:56:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734322821] [2024-11-20 05:56:59,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:56:59,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:56:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:56:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:56:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:56:59,750 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 05:56:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:56:59,781 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-20 05:56:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:56:59,784 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-20 05:56:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:56:59,791 INFO L225 Difference]: With dead ends: 89 [2024-11-20 05:56:59,792 INFO L226 Difference]: Without dead ends: 44 [2024-11-20 05:56:59,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:56:59,801 INFO L432 NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:56:59,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:56:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-20 05:56:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-20 05:56:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 05:56:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-20 05:56:59,853 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2024-11-20 05:56:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:56:59,854 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-20 05:56:59,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 05:56:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-20 05:56:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 05:56:59,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:59,860 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:56:59,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 05:57:00,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:57:00,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash -730463269, now seen corresponding path program 1 times [2024-11-20 05:57:00,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:57:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898593772] [2024-11-20 05:57:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:00,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:57:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:57:00,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:57:00,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 05:57:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:00,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 05:57:00,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:57:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 05:57:00,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:57:00,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:57:00,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898593772] [2024-11-20 05:57:00,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898593772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:57:00,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:57:00,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:57:00,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788039280] [2024-11-20 05:57:00,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:57:00,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:57:00,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:57:00,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:57:00,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:57:00,666 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 05:57:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:57:02,487 INFO L93 Difference]: Finished difference Result 127 states and 184 transitions. [2024-11-20 05:57:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:57:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-20 05:57:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:57:02,504 INFO L225 Difference]: With dead ends: 127 [2024-11-20 05:57:02,504 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 05:57:02,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:57:02,506 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 05:57:02,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 199 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 05:57:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 05:57:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2024-11-20 05:57:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 05:57:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2024-11-20 05:57:02,530 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 91 [2024-11-20 05:57:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:57:02,533 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2024-11-20 05:57:02,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 05:57:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2024-11-20 05:57:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 05:57:02,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:02,536 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:57:02,546 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 (3)] Ended with exit code 0 [2024-11-20 05:57:02,743 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-20 05:57:02,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:02,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1539809895, now seen corresponding path program 1 times [2024-11-20 05:57:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:57:02,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148357683] [2024-11-20 05:57:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:02,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:57:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:57:02,748 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-20 05:57:02,749 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-20 05:57:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:02,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 05:57:02,908 INFO L278 TraceCheckSpWp]: Computing forward predicates...