./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.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 2ca49ab820ec7b63f08a2ce22e67a701d1d86b8ff13cf45853d7baabaed2f9ad --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:19:10,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:19:10,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:19:10,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:19:10,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:19:10,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:19:10,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:19:10,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:19:10,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:19:10,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:19:10,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:19:10,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:19:10,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:19:10,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:19:10,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:19:10,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:19:10,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:19:10,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:19:10,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:19:10,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:19:10,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:19:10,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:19:10,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:19:10,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:19:10,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:19:10,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:19:10,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:19:10,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:19:10,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:19:10,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:19:10,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:19:10,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:19:10,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:19:10,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:19:10,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:19:10,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:19:10,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:19:10,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:19:10,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:19:10,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:19:10,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:19:10,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:19:10,173 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 -> 2ca49ab820ec7b63f08a2ce22e67a701d1d86b8ff13cf45853d7baabaed2f9ad [2024-11-08 20:19:10,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:19:10,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:19:10,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:19:10,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:19:10,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:19:10,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2024-11-08 20:19:11,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:19:12,135 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:19:12,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2024-11-08 20:19:12,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635401d7f/6d3d2dcd0344494db04dc150dbb1fc62/FLAG5f152d8a7 [2024-11-08 20:19:12,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635401d7f/6d3d2dcd0344494db04dc150dbb1fc62 [2024-11-08 20:19:12,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:19:12,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:19:12,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:19:12,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:19:12,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:19:12,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca7e276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12, skipping insertion in model container [2024-11-08 20:19:12,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:19:12,379 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_fillercode_fillercodesize_ps-cn-10_file-41.i[915,928] [2024-11-08 20:19:12,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:19:12,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:19:12,489 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_fillercode_fillercodesize_ps-cn-10_file-41.i[915,928] [2024-11-08 20:19:12,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:19:12,534 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:19:12,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12 WrapperNode [2024-11-08 20:19:12,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:19:12,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:19:12,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:19:12,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:19:12,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,598 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-08 20:19:12,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:19:12,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:19:12,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:19:12,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:19:12,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,669 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-08 20:19:12,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:19:12,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:19:12,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:19:12,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:19:12,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (1/1) ... [2024-11-08 20:19:12,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:19:12,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:12,771 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-08 20:19:12,775 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-08 20:19:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:19:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:19:12,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:19:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:19:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:19:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:19:12,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:19:12,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:19:13,273 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 20:19:13,273 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:19:13,289 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:19:13,289 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:19:13,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:13 BoogieIcfgContainer [2024-11-08 20:19:13,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:19:13,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:19:13,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:19:13,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:19:13,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:19:12" (1/3) ... [2024-11-08 20:19:13,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f50d81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:19:13, skipping insertion in model container [2024-11-08 20:19:13,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:12" (2/3) ... [2024-11-08 20:19:13,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f50d81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:19:13, skipping insertion in model container [2024-11-08 20:19:13,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:13" (3/3) ... [2024-11-08 20:19:13,302 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2024-11-08 20:19:13,320 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:19:13,320 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:19:13,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:19:13,403 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;@127a9bb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:19:13,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:19:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 20:19:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 20:19:13,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:13,424 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:13,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:13,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -96019935, now seen corresponding path program 1 times [2024-11-08 20:19:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:13,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181375994] [2024-11-08 20:19:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:19:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:19:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:19:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:19:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 20:19:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181375994] [2024-11-08 20:19:13,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181375994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:13,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:13,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:19:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618128754] [2024-11-08 20:19:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:13,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:19:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:14,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:19:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:19:14,022 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 20:19:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:14,060 INFO L93 Difference]: Finished difference Result 123 states and 210 transitions. [2024-11-08 20:19:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:19:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-11-08 20:19:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:14,072 INFO L225 Difference]: With dead ends: 123 [2024-11-08 20:19:14,072 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 20:19:14,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-08 20:19:14,082 INFO L432 NwaCegarLoop]: 90 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, 90 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-08 20:19:14,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:19:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 20:19:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-08 20:19:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 20:19:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-11-08 20:19:14,147 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 132 [2024-11-08 20:19:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:14,148 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-11-08 20:19:14,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 20:19:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2024-11-08 20:19:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 20:19:14,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:14,153 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:14,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:19:14,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:14,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1868566501, now seen corresponding path program 1 times [2024-11-08 20:19:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:14,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147142045] [2024-11-08 20:19:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:14,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:19:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845999152] [2024-11-08 20:19:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:14,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:14,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:14,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:19:14,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:19:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:15,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 20:19:15,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 393 proven. 24 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-08 20:19:15,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:19:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147142045] [2024-11-08 20:19:15,882 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 20:19:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845999152] [2024-11-08 20:19:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845999152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:15,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 20:19:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-08 20:19:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695469495] [2024-11-08 20:19:15,884 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 20:19:15,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:19:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:15,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:19:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:19:15,887 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 20:19:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:16,333 INFO L93 Difference]: Finished difference Result 161 states and 230 transitions. [2024-11-08 20:19:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 20:19:16,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-11-08 20:19:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:16,338 INFO L225 Difference]: With dead ends: 161 [2024-11-08 20:19:16,339 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 20:19:16,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-08 20:19:16,342 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 74 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:16,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 293 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:19:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 20:19:16,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2024-11-08 20:19:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 62 states have internal predecessors, (74), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 20:19:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2024-11-08 20:19:16,374 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 132 [2024-11-08 20:19:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:16,376 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2024-11-08 20:19:16,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 20:19:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2024-11-08 20:19:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 20:19:16,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:16,380 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:16,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:19:16,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:16,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:16,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1188508131, now seen corresponding path program 1 times [2024-11-08 20:19:16,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:16,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994047130] [2024-11-08 20:19:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:19:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959546276] [2024-11-08 20:19:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:16,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:16,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:19:16,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 20:19:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:17,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 20:19:17,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 393 proven. 24 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-08 20:19:17,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:19:17,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:17,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994047130] [2024-11-08 20:19:17,827 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 20:19:17,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959546276] [2024-11-08 20:19:17,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959546276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:17,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 20:19:17,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-08 20:19:17,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327143944] [2024-11-08 20:19:17,827 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 20:19:17,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:19:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:17,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:19:17,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:19:17,831 INFO L87 Difference]: Start difference. First operand 96 states and 136 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 20:19:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:18,244 INFO L93 Difference]: Finished difference Result 202 states and 280 transitions. [2024-11-08 20:19:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 20:19:18,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-11-08 20:19:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:18,248 INFO L225 Difference]: With dead ends: 202 [2024-11-08 20:19:18,249 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 20:19:18,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-08 20:19:18,254 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 83 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:18,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 283 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:19:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 20:19:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2024-11-08 20:19:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 20:19:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2024-11-08 20:19:18,273 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 132 [2024-11-08 20:19:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:18,274 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2024-11-08 20:19:18,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 20:19:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2024-11-08 20:19:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 20:19:18,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:18,279 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:18,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 20:19:18,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 20:19:18,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:18,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2146335540, now seen corresponding path program 1 times [2024-11-08 20:19:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056302258] [2024-11-08 20:19:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:19:18,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138949932] [2024-11-08 20:19:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:18,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:18,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:18,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:19:18,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 20:19:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:19:18,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:19:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:19:18,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:19:18,926 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:19:18,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:19:18,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 20:19:19,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:19,134 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 20:19:19,256 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:19:19,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:19:19 BoogieIcfgContainer [2024-11-08 20:19:19,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:19:19,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:19:19,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:19:19,260 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:19:19,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:13" (3/4) ... [2024-11-08 20:19:19,263 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:19:19,264 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:19:19,265 INFO L158 Benchmark]: Toolchain (without parser) took 7103.53ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 77.5MB in the beginning and 103.9MB in the end (delta: -26.4MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-08 20:19:19,265 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:19:19,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.43ms. Allocated memory is still 146.8MB. Free memory was 77.1MB in the beginning and 61.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 20:19:19,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.34ms. Allocated memory is still 146.8MB. Free memory was 61.3MB in the beginning and 57.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:19:19,266 INFO L158 Benchmark]: Boogie Preprocessor took 120.62ms. Allocated memory is still 146.8MB. Free memory was 57.9MB in the beginning and 117.6MB in the end (delta: -59.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 20:19:19,266 INFO L158 Benchmark]: RCFGBuilder took 562.00ms. Allocated memory is still 146.8MB. Free memory was 117.3MB in the beginning and 94.2MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 20:19:19,267 INFO L158 Benchmark]: TraceAbstraction took 5966.33ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 93.5MB in the beginning and 103.9MB in the end (delta: -10.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2024-11-08 20:19:19,267 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 195.0MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:19:19,268 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.43ms. Allocated memory is still 146.8MB. Free memory was 77.1MB in the beginning and 61.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.34ms. Allocated memory is still 146.8MB. Free memory was 61.3MB in the beginning and 57.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.62ms. Allocated memory is still 146.8MB. Free memory was 57.9MB in the beginning and 117.6MB in the end (delta: -59.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 562.00ms. Allocated memory is still 146.8MB. Free memory was 117.3MB in the beginning and 94.2MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5966.33ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 93.5MB in the beginning and 103.9MB in the end (delta: -10.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 195.0MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] signed short int var_1_24 = 25; [L39] float var_1_25 = 32.6; [L40] signed short int var_1_26 = 8; [L41] unsigned char var_1_27 = 50; [L42] unsigned char var_1_28 = 8; [L43] signed short int var_1_29 = 10; [L44] signed long int var_1_30 = -4; [L45] signed char var_1_31 = -50; [L46] signed char var_1_32 = -32; [L47] unsigned char last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] CALL updateLastVariables() [L136] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] RET updateLastVariables() [L147] CALL updateVariables() [L103] var_1_4 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] var_1_5 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L109] var_1_11 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L112] var_1_12 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L115] var_1_14 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] var_1_16 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] var_1_18 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L123] var_1_25 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_25 >= -922337.2036854776000e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] RET assume_abort_if_not((var_1_25 >= -922337.2036854776000e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] var_1_26 = __VERIFIER_nondet_short() [L126] CALL assume_abort_if_not(var_1_26 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L126] RET assume_abort_if_not(var_1_26 >= -32766) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] CALL assume_abort_if_not(var_1_26 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] RET assume_abort_if_not(var_1_26 <= 32766) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L128] var_1_28 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L129] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L130] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L130] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L131] var_1_32 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_32 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L132] RET assume_abort_if_not(var_1_32 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L133] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L133] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L147] RET updateVariables() [L148] CALL step() [L51] COND TRUE 32.2f > (25.5f - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))) [L52] var_1_24 = ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L54] var_1_27 = var_1_28 [L55] var_1_29 = var_1_26 [L56] var_1_30 = var_1_29 [L57] var_1_31 = var_1_32 [L58] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L59] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L66] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L71] COND TRUE (- var_1_13) > 31.9f [L72] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L76] COND TRUE \read(var_1_1) [L77] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L79] var_1_22 = 1 [L80] var_1_23 = var_1_22 [L81] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L82] COND FALSE !(var_1_15 > stepLocal_0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L85] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=0, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=81920, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L86] COND TRUE var_1_1 || stepLocal_2 [L87] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=16384, var_1_18=81920, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L91] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=16384, var_1_18=81920, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=16384, var_1_18=81920, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L95] COND FALSE !(! (var_1_17 <= var_1_17)) [L98] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=16384, var_1_18=81920, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] RET step() [L149] CALL, EXPR property() [L139-L140] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=16384, var_1_18=81920, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=16384, var_1_18=81920, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=16384, var_1_18=81920, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 666 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 244 mSDtfsCounter, 672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 30, 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, 47 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 926 NumberOfCodeBlocks, 926 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 931 SizeOfPredicates, 8 NumberOfNonLiveVariables, 660 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2232/2280 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-08 20:19:19,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.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 2ca49ab820ec7b63f08a2ce22e67a701d1d86b8ff13cf45853d7baabaed2f9ad --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:19:21,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:19:21,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:19:21,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:19:21,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:19:21,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:19:21,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:19:21,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:19:21,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:19:21,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:19:21,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:19:21,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:19:21,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:19:21,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:19:21,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:19:21,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:19:21,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:19:21,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:19:21,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:19:21,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:19:21,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:19:21,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:19:21,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:19:21,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:19:21,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:19:21,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:19:21,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:19:21,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:19:21,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:19:21,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:19:21,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:19:21,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:19:21,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:19:21,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:19:21,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:19:21,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:19:21,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:19:21,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:19:21,674 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:19:21,674 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:19:21,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:19:21,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:19:21,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:19:21,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:19:21,676 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 -> 2ca49ab820ec7b63f08a2ce22e67a701d1d86b8ff13cf45853d7baabaed2f9ad [2024-11-08 20:19:22,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:19:22,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:19:22,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:19:22,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:19:22,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:19:22,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2024-11-08 20:19:23,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:19:23,979 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:19:23,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2024-11-08 20:19:23,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455c1aa1f/d2f95fda43364cd4b2b7110b046a5fa6/FLAG2ba5c992f [2024-11-08 20:19:24,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455c1aa1f/d2f95fda43364cd4b2b7110b046a5fa6 [2024-11-08 20:19:24,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:19:24,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:19:24,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:19:24,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:19:24,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:19:24,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a7a0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24, skipping insertion in model container [2024-11-08 20:19:24,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:19:24,577 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_fillercode_fillercodesize_ps-cn-10_file-41.i[915,928] [2024-11-08 20:19:24,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:19:24,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:19:24,700 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_fillercode_fillercodesize_ps-cn-10_file-41.i[915,928] [2024-11-08 20:19:24,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:19:24,763 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:19:24,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24 WrapperNode [2024-11-08 20:19:24,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:19:24,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:19:24,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:19:24,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:19:24,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,831 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-08 20:19:24,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:19:24,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:19:24,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:19:24,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:19:24,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,887 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-08 20:19:24,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:19:24,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:19:24,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:19:24,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:19:24,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (1/1) ... [2024-11-08 20:19:24,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:19:24,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:24,967 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-08 20:19:24,974 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-08 20:19:25,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:19:25,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:19:25,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:19:25,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:19:25,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:19:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:19:25,118 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:19:25,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:19:28,549 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 20:19:28,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:19:28,563 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:19:28,563 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:19:28,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:28 BoogieIcfgContainer [2024-11-08 20:19:28,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:19:28,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:19:28,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:19:28,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:19:28,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:19:24" (1/3) ... [2024-11-08 20:19:28,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622aaa60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:19:28, skipping insertion in model container [2024-11-08 20:19:28,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:24" (2/3) ... [2024-11-08 20:19:28,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622aaa60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:19:28, skipping insertion in model container [2024-11-08 20:19:28,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:28" (3/3) ... [2024-11-08 20:19:28,574 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2024-11-08 20:19:28,592 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:19:28,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:19:28,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:19:28,691 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;@3224c4e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:19:28,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:19:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 20:19:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 20:19:28,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:28,713 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:28,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:28,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -96019935, now seen corresponding path program 1 times [2024-11-08 20:19:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:19:28,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486007187] [2024-11-08 20:19:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:28,738 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-08 20:19:28,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:19:28,741 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-08 20:19:28,743 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-08 20:19:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:29,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:19:29,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-11-08 20:19:29,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:19:29,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:19:29,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486007187] [2024-11-08 20:19:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486007187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:29,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:29,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:19:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590388689] [2024-11-08 20:19:29,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:29,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:19:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:19:29,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:19:29,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:19:29,304 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 20:19:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:29,337 INFO L93 Difference]: Finished difference Result 123 states and 210 transitions. [2024-11-08 20:19:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:19:29,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-11-08 20:19:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:29,349 INFO L225 Difference]: With dead ends: 123 [2024-11-08 20:19:29,349 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 20:19:29,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:19:29,360 INFO L432 NwaCegarLoop]: 90 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, 90 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-08 20:19:29,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:19:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 20:19:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-08 20:19:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 20:19:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-11-08 20:19:29,403 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 132 [2024-11-08 20:19:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:29,404 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-11-08 20:19:29,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 20:19:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2024-11-08 20:19:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 20:19:29,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:29,410 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:29,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:19:29,614 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-08 20:19:29,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:29,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:29,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1868566501, now seen corresponding path program 1 times [2024-11-08 20:19:29,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:19:29,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417711513] [2024-11-08 20:19:29,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:29,624 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-08 20:19:29,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:19:29,626 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-08 20:19:29,654 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-08 20:19:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:29,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 20:19:29,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 20:19:31,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:19:31,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:19:31,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417711513] [2024-11-08 20:19:31,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417711513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:31,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:31,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:19:31,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579085409] [2024-11-08 20:19:31,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:31,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:19:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:19:31,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:19:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:19:31,822 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 20:19:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:34,831 INFO L93 Difference]: Finished difference Result 176 states and 262 transitions. [2024-11-08 20:19:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:19:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-08 20:19:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:34,839 INFO L225 Difference]: With dead ends: 176 [2024-11-08 20:19:34,839 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 20:19:34,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:19:34,841 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:34,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 157 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 20:19:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 20:19:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-11-08 20:19:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:19:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2024-11-08 20:19:34,873 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 132 [2024-11-08 20:19:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:34,874 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2024-11-08 20:19:34,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 20:19:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2024-11-08 20:19:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 20:19:34,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:34,879 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:34,893 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-08 20:19:35,079 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-08 20:19:35,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:35,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2126731939, now seen corresponding path program 1 times [2024-11-08 20:19:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:19:35,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366437121] [2024-11-08 20:19:35,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:35,082 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-08 20:19:35,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:19:35,084 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-08 20:19:35,085 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-08 20:19:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:35,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 20:19:35,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 403 proven. 42 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-08 20:19:36,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:19:38,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:19:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366437121] [2024-11-08 20:19:38,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366437121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1454163088] [2024-11-08 20:19:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:38,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 20:19:38,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 20:19:38,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 20:19:38,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-08 20:19:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:39,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:19:39,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 20:19:39,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:19:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1454163088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:39,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 20:19:39,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-08 20:19:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794933175] [2024-11-08 20:19:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:39,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:19:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:19:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:19:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-08 20:19:39,595 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 20:19:41,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:19:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:41,617 INFO L93 Difference]: Finished difference Result 339 states and 504 transitions. [2024-11-08 20:19:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:19:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-08 20:19:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:41,621 INFO L225 Difference]: With dead ends: 339 [2024-11-08 20:19:41,621 INFO L226 Difference]: Without dead ends: 227 [2024-11-08 20:19:41,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-08 20:19:41,624 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 80 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:41,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 433 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 20:19:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-08 20:19:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2024-11-08 20:19:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 140 states have internal predecessors, (172), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-08 20:19:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 332 transitions. [2024-11-08 20:19:41,658 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 332 transitions. Word has length 132 [2024-11-08 20:19:41,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:41,659 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 332 transitions. [2024-11-08 20:19:41,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 20:19:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 332 transitions. [2024-11-08 20:19:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 20:19:41,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:41,661 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:41,675 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 (4)] Ended with exit code 0 [2024-11-08 20:19:41,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-08 20:19:42,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 20:19:42,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:42,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1446673569, now seen corresponding path program 1 times [2024-11-08 20:19:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:19:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976728872] [2024-11-08 20:19:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:42,065 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-08 20:19:42,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:19:42,067 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 20:19:42,069 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 (6)] Waiting until timeout for monitored process [2024-11-08 20:19:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:42,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 20:19:42,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 403 proven. 42 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-08 20:19:43,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:19:44,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:19:44,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976728872] [2024-11-08 20:19:44,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976728872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:44,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [25689716] [2024-11-08 20:19:44,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:44,977 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 20:19:44,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 20:19:44,978 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 20:19:44,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-08 20:19:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:45,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:19:45,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 403 proven. 42 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-08 20:19:46,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:19:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [25689716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:47,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:19:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-08 20:19:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738443705] [2024-11-08 20:19:47,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:19:47,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 20:19:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:19:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 20:19:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:19:47,564 INFO L87 Difference]: Start difference. First operand 225 states and 332 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 20:19:50,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:19:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:50,487 INFO L93 Difference]: Finished difference Result 487 states and 693 transitions. [2024-11-08 20:19:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 20:19:50,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 132 [2024-11-08 20:19:50,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:50,521 INFO L225 Difference]: With dead ends: 487 [2024-11-08 20:19:50,521 INFO L226 Difference]: Without dead ends: 265 [2024-11-08 20:19:50,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 20:19:50,523 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:50,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 233 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 20:19:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-08 20:19:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 257. [2024-11-08 20:19:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 164 states have (on average 1.1829268292682926) internal successors, (194), 164 states have internal predecessors, (194), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-08 20:19:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 354 transitions. [2024-11-08 20:19:50,558 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 354 transitions. Word has length 132 [2024-11-08 20:19:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:50,558 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 354 transitions. [2024-11-08 20:19:50,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 20:19:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 354 transitions. [2024-11-08 20:19:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 20:19:50,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:50,561 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:19:50,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-08 20:19:50,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 20:19:50,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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-08 20:19:50,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:50,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1559529526, now seen corresponding path program 1 times [2024-11-08 20:19:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:19:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221305431] [2024-11-08 20:19:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:50,963 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-08 20:19:50,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:19:50,966 INFO L229 MonitoredProcess]: Starting monitored process 8 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-08 20:19:50,967 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 (8)] Waiting until timeout for monitored process [2024-11-08 20:19:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:51,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 20:19:51,283 INFO L278 TraceCheckSpWp]: Computing forward predicates...