./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.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 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:15:47,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:15:47,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:15:47,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:15:47,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:15:47,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:15:47,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:15:47,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:15:47,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:15:47,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:15:47,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:15:47,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:15:47,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:15:47,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:15:47,183 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:15:47,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:15:47,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:15:47,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:15:47,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:15:47,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:15:47,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:15:47,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:15:47,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:15:47,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:15:47,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:15:47,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:15:47,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:15:47,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:15:47,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:15:47,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:15:47,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:15:47,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:15:47,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:15:47,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:15:47,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:15:47,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:15:47,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:15:47,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:15:47,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:15:47,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:15:47,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:15:47,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:15:47,193 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 -> 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 [2024-10-24 05:15:47,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:15:47,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:15:47,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:15:47,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:15:47,475 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:15:47,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-10-24 05:15:48,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:15:49,196 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:15:49,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-10-24 05:15:49,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fc575f3/363f1809b4f84812926e82074849910a/FLAG49cc1d84b [2024-10-24 05:15:49,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fc575f3/363f1809b4f84812926e82074849910a [2024-10-24 05:15:49,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:15:49,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:15:49,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:15:49,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:15:49,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:15:49,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b42a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49, skipping insertion in model container [2024-10-24 05:15:49,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:15:49,435 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i[919,932] [2024-10-24 05:15:49,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:15:49,553 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:15:49,563 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i[919,932] [2024-10-24 05:15:49,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:15:49,607 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:15:49,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49 WrapperNode [2024-10-24 05:15:49,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:15:49,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:15:49,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:15:49,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:15:49,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,659 INFO L138 Inliner]: procedures = 31, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 152 [2024-10-24 05:15:49,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:15:49,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:15:49,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:15:49,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:15:49,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,695 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:15:49,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:15:49,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:15:49,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:15:49,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:15:49,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (1/1) ... [2024-10-24 05:15:49,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:15:49,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:15:49,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:15:49,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:15:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:15:49,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:15:49,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:15:49,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:15:49,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:15:49,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:15:49,922 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:15:49,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:15:50,237 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-24 05:15:50,237 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:15:50,295 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:15:50,296 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:15:50,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:15:50 BoogieIcfgContainer [2024-10-24 05:15:50,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:15:50,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:15:50,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:15:50,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:15:50,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:15:49" (1/3) ... [2024-10-24 05:15:50,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590a8289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:15:50, skipping insertion in model container [2024-10-24 05:15:50,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:49" (2/3) ... [2024-10-24 05:15:50,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590a8289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:15:50, skipping insertion in model container [2024-10-24 05:15:50,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:15:50" (3/3) ... [2024-10-24 05:15:50,306 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-6.i [2024-10-24 05:15:50,322 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:15:50,322 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:15:50,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:15:50,401 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;@1d6b7b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:15:50,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:15:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:15:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 05:15:50,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:15:50,424 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:15:50,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:15:50,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:15:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1192508956, now seen corresponding path program 1 times [2024-10-24 05:15:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:15:50,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710307046] [2024-10-24 05:15:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:15:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:15:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:15:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:15:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:15:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:15:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:15:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:15:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:15:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:15:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:15:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 05:15:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:15:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 05:15:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:15:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 05:15:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:15:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:15:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 05:15:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 05:15:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:15:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 05:15:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:15:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710307046] [2024-10-24 05:15:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710307046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:15:50,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:15:50,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:15:50,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757236084] [2024-10-24 05:15:50,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:15:50,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:15:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:15:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:15:50,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:15:50,938 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 05:15:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:15:51,016 INFO L93 Difference]: Finished difference Result 111 states and 191 transitions. [2024-10-24 05:15:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:15:51,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-10-24 05:15:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:15:51,030 INFO L225 Difference]: With dead ends: 111 [2024-10-24 05:15:51,031 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 05:15:51,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:15:51,040 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:15:51,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:15:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 05:15:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-24 05:15:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:15:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-10-24 05:15:51,087 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 121 [2024-10-24 05:15:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:15:51,088 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-10-24 05:15:51,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 05:15:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-10-24 05:15:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 05:15:51,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:15:51,093 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:15:51,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:15:51,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:15:51,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:15:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1679672290, now seen corresponding path program 1 times [2024-10-24 05:15:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:15:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054132658] [2024-10-24 05:15:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:15:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:15:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:15:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:15:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:15:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:15:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:15:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:15:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:15:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:15:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:15:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 05:15:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:15:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 05:15:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:15:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 05:15:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:15:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:15:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 05:15:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 05:15:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:15:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 05:15:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:15:52,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054132658] [2024-10-24 05:15:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054132658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:15:52,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481325520] [2024-10-24 05:15:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:15:52,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:15:52,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:15:52,109 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-10-24 05:15:52,115 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-10-24 05:15:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:52,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 05:15:52,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:15:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 437 proven. 39 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-24 05:15:52,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:15:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 63 proven. 42 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-10-24 05:15:53,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481325520] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:15:53,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:15:53,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-10-24 05:15:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989768768] [2024-10-24 05:15:53,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:15:53,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 05:15:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:15:53,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 05:15:53,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-24 05:15:53,052 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-10-24 05:15:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:15:53,774 INFO L93 Difference]: Finished difference Result 127 states and 177 transitions. [2024-10-24 05:15:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 05:15:53,776 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 121 [2024-10-24 05:15:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:15:53,777 INFO L225 Difference]: With dead ends: 127 [2024-10-24 05:15:53,778 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 05:15:53,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=747, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 05:15:53,782 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 186 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:15:53,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 152 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:15:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 05:15:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-10-24 05:15:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:15:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-10-24 05:15:53,803 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 121 [2024-10-24 05:15:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:15:53,804 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-10-24 05:15:53,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-10-24 05:15:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-10-24 05:15:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 05:15:53,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:15:53,806 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:15:53,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:15:54,007 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-10-24 05:15:54,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:15:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:15:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -107607856, now seen corresponding path program 1 times [2024-10-24 05:15:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:15:54,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769443535] [2024-10-24 05:15:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:15:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:15:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:15:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263239839] [2024-10-24 05:15:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:15:54,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:15:54,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:15:54,099 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-10-24 05:15:54,102 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-10-24 05:15:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:15:54,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:15:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:15:54,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:15:54,331 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:15:54,332 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:15:54,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 05:15:54,537 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-10-24 05:15:54,541 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 05:15:54,637 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:15:54,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:15:54 BoogieIcfgContainer [2024-10-24 05:15:54,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:15:54,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:15:54,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:15:54,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:15:54,647 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:15:50" (3/4) ... [2024-10-24 05:15:54,649 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:15:54,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:15:54,651 INFO L158 Benchmark]: Toolchain (without parser) took 5418.66ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 96.5MB in the beginning and 84.6MB in the end (delta: 11.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-10-24 05:15:54,651 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 91.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:15:54,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.27ms. Allocated memory is still 153.1MB. Free memory was 96.1MB in the beginning and 122.5MB in the end (delta: -26.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:15:54,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.89ms. Allocated memory is still 153.1MB. Free memory was 122.5MB in the beginning and 119.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:15:54,652 INFO L158 Benchmark]: Boogie Preprocessor took 57.89ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 116.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:15:54,652 INFO L158 Benchmark]: RCFGBuilder took 578.30ms. Allocated memory is still 153.1MB. Free memory was 116.2MB in the beginning and 93.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 05:15:54,652 INFO L158 Benchmark]: TraceAbstraction took 4346.66ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 93.1MB in the beginning and 84.6MB in the end (delta: 8.5MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2024-10-24 05:15:54,653 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 184.5MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:15:54,654 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.11ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 91.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.27ms. Allocated memory is still 153.1MB. Free memory was 96.1MB in the beginning and 122.5MB in the end (delta: -26.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.89ms. Allocated memory is still 153.1MB. Free memory was 122.5MB in the beginning and 119.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.89ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 116.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 578.30ms. Allocated memory is still 153.1MB. Free memory was 116.2MB in the beginning and 93.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4346.66ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 93.1MB in the beginning and 84.6MB in the end (delta: 8.5MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 184.5MB. Free memory is still 84.6MB. 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 134, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryArithmeticFLOAToperation at line 59. Possible FailurePath: [L26] unsigned char isInitial = 0; [L27] double var_1_1 = 100.25; [L28] unsigned char var_1_2 = 0; [L29] unsigned char var_1_3 = 8; [L30] unsigned char var_1_4 = 0; [L31] double var_1_5 = 1.9; [L32] double var_1_6 = 7.5; [L33] double var_1_7 = 64.25; [L34] signed long int var_1_8 = 2; [L35] signed long int var_1_9 = 1000000000; [L36] signed long int var_1_10 = 1000000000; [L37] signed long int var_1_11 = 1957998270; [L38] float var_1_12 = 50.25; [L39] float var_1_13 = 9.8; [L40] float var_1_14 = 25.5; [L41] float var_1_15 = 3.5; [L42] signed long int var_1_16 = -500; [L43] unsigned char var_1_17 = 1; [L44] unsigned char var_1_18 = 1; [L45] unsigned char var_1_19 = 0; [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] FCALL updateLastVariables() [L142] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L101] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L101] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L102] var_1_3 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L104] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L104] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L105] var_1_4 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L106] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L107] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L107] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L108] var_1_5 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L109] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L110] var_1_6 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L111] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L112] var_1_7 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L113] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L114] var_1_9 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L115] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L116] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L116] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L117] var_1_10 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L118] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, var_1_10=536870954, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L119] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L119] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, var_1_10=536870954, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L120] var_1_11 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L121] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L122] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L122] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L123] var_1_14 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L124] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L125] var_1_15 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L126] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L127] var_1_18 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L128] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L129] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L129] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L142] RET updateVariables() [L143] CALL step() [L82] CALL functionized0(var_1_7, 4.125) [L47] COND FALSE !(\read(var_1_2)) [L54] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_5=3, var_1_7=2, var_1_8=2, var_1_9=536870911] [L82] RET functionized0(var_1_7, 4.125) [L83] var_1_8 = (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=42, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L84] COND TRUE ((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11) [L85] var_1_12 = var_1_7 VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=42, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L87] CALL functionized1(var_1_8, var_1_15, var_1_14) [L58] COND TRUE functionized1_localFunctionVar0 < var_1_11 [L59] var_1_13 = ((7.3868261718112563E18f - (functionized1_localFunctionVar2 + functionized1_localFunctionVar1)) - 5.4f) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=2, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=42, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L87] RET functionized1(var_1_8, var_1_15, var_1_14) [L88] CALL functionized2(var_1_6, var_1_5, var_1_13) [L65] COND FALSE !((((((- var_1_15)) > ((functionized2_localFunctionVar2 * functionized2_localFunctionVar0))) ? ((- var_1_15)) : ((functionized2_localFunctionVar2 * functionized2_localFunctionVar0)))) < functionized2_localFunctionVar1) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=42, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L88] RET functionized2(var_1_6, var_1_5, var_1_13) [L89] CALL functionized3(var_1_16, var_1_8, var_1_18, var_1_9) [L74] var_1_17 = (((var_1_3 * functionized3_localFunctionVar3) >= ((((functionized3_localFunctionVar0) > (functionized3_localFunctionVar1)) ? (functionized3_localFunctionVar0) : (functionized3_localFunctionVar1)))) || functionized3_localFunctionVar2) [L89] RET functionized3(var_1_16, var_1_8, var_1_18, var_1_9) [L90] COND TRUE \read(var_1_17) [L91] CALL, EXPR functionized4() [L77] return (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375)); [L91] RET, EXPR functionized4() [L91] COND TRUE var_1_7 > functionized4() [L92] var_1_19 = var_1_18 VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=42, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L143] RET step() [L144] CALL, EXPR property() [L134-L135] return ((((((var_1_2 ? ((var_1_3 >= var_1_4) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_8 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((var_1_13 * var_1_6))) ? ((- var_1_15)) : ((var_1_13 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((var_1_8) < (var_1_10)) ? (var_1_8) : (var_1_10)))) ? (var_1_2 ? (var_1_16 == ((signed long int) var_1_3)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_3 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=42, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, var_1_10=536870954, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=42, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 124 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=2, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 607 NumberOfCodeBlocks, 607 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051 SizeOfPredicates, 7 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2652/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:15:54,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.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 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:15:56,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:15:57,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:15:57,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:15:57,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:15:57,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:15:57,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:15:57,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:15:57,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:15:57,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:15:57,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:15:57,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:15:57,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:15:57,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:15:57,071 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:15:57,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:15:57,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:15:57,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:15:57,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:15:57,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:15:57,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:15:57,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:15:57,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:15:57,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:15:57,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:15:57,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:15:57,081 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:15:57,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:15:57,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:15:57,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:15:57,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:15:57,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:15:57,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:15:57,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:15:57,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:15:57,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:15:57,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:15:57,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:15:57,084 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:15:57,084 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:15:57,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:15:57,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:15:57,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:15:57,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:15:57,086 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:15:57,087 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 -> 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 [2024-10-24 05:15:57,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:15:57,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:15:57,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:15:57,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:15:57,434 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:15:57,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-10-24 05:15:59,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:15:59,338 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:15:59,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-10-24 05:15:59,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca70d1ccc/32e8e7cfb6854ea6b93fca7a8b4554e2/FLAGcee41ea58 [2024-10-24 05:15:59,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca70d1ccc/32e8e7cfb6854ea6b93fca7a8b4554e2 [2024-10-24 05:15:59,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:15:59,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:15:59,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:15:59,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:15:59,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:15:59,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710fbbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59, skipping insertion in model container [2024-10-24 05:15:59,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:15:59,619 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i[919,932] [2024-10-24 05:15:59,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:15:59,706 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:15:59,720 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i[919,932] [2024-10-24 05:15:59,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:15:59,763 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:15:59,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59 WrapperNode [2024-10-24 05:15:59,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:15:59,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:15:59,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:15:59,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:15:59,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,834 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 149 [2024-10-24 05:15:59,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:15:59,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:15:59,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:15:59,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:15:59,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,874 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:15:59,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:15:59,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:15:59,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:15:59,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:15:59,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (1/1) ... [2024-10-24 05:15:59,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:15:59,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:15:59,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:15:59,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:16:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:16:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:16:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:16:00,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:16:00,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:16:00,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:16:00,107 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:16:00,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:16:19,277 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-24 05:16:19,277 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:16:19,348 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:16:19,349 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:16:19,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:16:19 BoogieIcfgContainer [2024-10-24 05:16:19,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:16:19,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:16:19,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:16:19,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:16:19,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:15:59" (1/3) ... [2024-10-24 05:16:19,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa90b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:16:19, skipping insertion in model container [2024-10-24 05:16:19,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:15:59" (2/3) ... [2024-10-24 05:16:19,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa90b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:16:19, skipping insertion in model container [2024-10-24 05:16:19,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:16:19" (3/3) ... [2024-10-24 05:16:19,359 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-6.i [2024-10-24 05:16:19,374 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:16:19,374 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:16:19,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:16:19,444 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;@3cac03ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:16:19,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:16:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:16:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 05:16:19,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:19,459 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:19,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:19,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1192508956, now seen corresponding path program 1 times [2024-10-24 05:16:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:16:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530054943] [2024-10-24 05:16:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:19,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:16:19,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:16:19,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:16:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:16:20,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:16:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-10-24 05:16:20,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:16:20,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:16:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530054943] [2024-10-24 05:16:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530054943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:20,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:16:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351427825] [2024-10-24 05:16:20,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:20,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:16:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:16:20,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:16:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:16:20,628 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 05:16:24,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:16:29,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:16:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:29,139 INFO L93 Difference]: Finished difference Result 111 states and 191 transitions. [2024-10-24 05:16:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:16:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-10-24 05:16:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:29,252 INFO L225 Difference]: With dead ends: 111 [2024-10-24 05:16:29,252 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 05:16:29,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:16:29,257 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:29,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-10-24 05:16:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 05:16:29,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-24 05:16:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:16:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-10-24 05:16:29,304 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 121 [2024-10-24 05:16:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:29,305 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-10-24 05:16:29,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 05:16:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-10-24 05:16:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 05:16:29,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:29,308 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:29,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:16:29,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:29,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:29,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1679672290, now seen corresponding path program 1 times [2024-10-24 05:16:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:16:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193143249] [2024-10-24 05:16:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:29,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:29,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:16:29,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:16:29,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:16:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:30,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 05:16:30,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:16:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-24 05:16:31,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:16:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 05:16:34,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:16:34,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193143249] [2024-10-24 05:16:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193143249] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:16:34,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:16:34,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 05:16:34,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139801734] [2024-10-24 05:16:34,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:16:34,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:16:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:16:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:16:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:16:34,509 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:16:41,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:16:44,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:16:49,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:16:53,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:16:57,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:16:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:57,148 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2024-10-24 05:16:57,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:16:57,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 121 [2024-10-24 05:16:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:57,256 INFO L225 Difference]: With dead ends: 115 [2024-10-24 05:16:57,256 INFO L226 Difference]: Without dead ends: 61 [2024-10-24 05:16:57,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-24 05:16:57,258 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 154 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 151 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:57,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 122 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 21.8s Time] [2024-10-24 05:16:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-24 05:16:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2024-10-24 05:16:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:16:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2024-10-24 05:16:57,274 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 121 [2024-10-24 05:16:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:57,275 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2024-10-24 05:16:57,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:16:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2024-10-24 05:16:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 05:16:57,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:57,278 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:57,322 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-10-24 05:16:57,478 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-10-24 05:16:57,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:57,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash 593456722, now seen corresponding path program 1 times [2024-10-24 05:16:57,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:16:57,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3384784] [2024-10-24 05:16:57,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:57,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:57,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:16:57,485 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-10-24 05:16:57,486 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-10-24 05:16:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:58,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 05:16:58,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:17:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 437 proven. 39 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-24 05:17:02,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:17:03,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:17:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3384784] [2024-10-24 05:17:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3384784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:17:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2030555644] [2024-10-24 05:17:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:17:03,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 05:17:03,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 05:17:03,495 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-10-24 05:17:03,496 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-10-24 05:17:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:17:06,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 05:17:06,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:17:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 428 proven. 57 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-10-24 05:17:11,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:17:12,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2030555644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:17:12,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:17:12,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 12 [2024-10-24 05:17:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717486749] [2024-10-24 05:17:12,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:17:12,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 05:17:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:17:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 05:17:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 05:17:12,529 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 5 states have call successors, (27), 5 states have call predecessors, (27), 8 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-24 05:17:18,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []