./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a5a79563eebf4c0adb85c657f2e56816668e0af593ca846b35361e1efa1ac928 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:28:24,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:28:24,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:28:24,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:28:24,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:28:24,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:28:24,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:28:24,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:28:24,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:28:24,878 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:28:24,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:28:24,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:28:24,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:28:24,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:28:24,878 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:28:24,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:28:24,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:28:24,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:24,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:24,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:28:24,880 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> a5a79563eebf4c0adb85c657f2e56816668e0af593ca846b35361e1efa1ac928 [2025-01-09 11:28:25,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:28:25,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:28:25,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:28:25,116 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:28:25,117 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:28:25,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2025-01-09 11:28:26,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/405b27b77/66290cc32daf4f859071e67ae642fb3a/FLAG808051338 [2025-01-09 11:28:26,579 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:28:26,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2025-01-09 11:28:26,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/405b27b77/66290cc32daf4f859071e67ae642fb3a/FLAG808051338 [2025-01-09 11:28:26,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/405b27b77/66290cc32daf4f859071e67ae642fb3a [2025-01-09 11:28:26,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:28:26,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:28:26,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:28:26,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:28:26,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:28:26,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4beb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26, skipping insertion in model container [2025-01-09 11:28:26,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:28:26,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i[919,932] [2025-01-09 11:28:26,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:28:26,809 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:28:26,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i[919,932] [2025-01-09 11:28:26,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:28:26,873 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:28:26,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26 WrapperNode [2025-01-09 11:28:26,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:28:26,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:28:26,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:28:26,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:28:26,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,930 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-01-09 11:28:26,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:28:26,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:28:26,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:28:26,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:28:26,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,966 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]. [2025-01-09 11:28:26,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:28:26,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:28:26,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:28:26,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:28:26,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (1/1) ... [2025-01-09 11:28:26,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:27,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:27,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:28:27,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:28:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:28:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:28:27,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:28:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:28:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:28:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:28:27,109 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:28:27,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:28:27,429 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:28:27,429 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:28:27,440 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:28:27,440 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:28:27,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:27 BoogieIcfgContainer [2025-01-09 11:28:27,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:28:27,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:28:27,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:28:27,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:28:27,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:28:26" (1/3) ... [2025-01-09 11:28:27,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c70bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:28:27, skipping insertion in model container [2025-01-09 11:28:27,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:26" (2/3) ... [2025-01-09 11:28:27,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c70bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:28:27, skipping insertion in model container [2025-01-09 11:28:27,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:27" (3/3) ... [2025-01-09 11:28:27,450 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2025-01-09 11:28:27,460 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:28:27,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:28:27,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:28:27,518 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;@6dc805e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:28:27,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:28:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:28:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 11:28:27,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:27,535 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:27,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:27,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -288857208, now seen corresponding path program 1 times [2025-01-09 11:28:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:27,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444544904] [2025-01-09 11:28:27,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:27,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 11:28:27,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 11:28:27,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:27,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 11:28:27,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444544904] [2025-01-09 11:28:27,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444544904] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:28:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367714274] [2025-01-09 11:28:27,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:27,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:27,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:27,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:28:27,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:28:27,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 11:28:27,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 11:28:27,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:27,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:27,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:28:27,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 11:28:27,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:28:27,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367714274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:27,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:28:27,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:28:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343393914] [2025-01-09 11:28:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:28,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:28:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:28,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:28:28,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:28:28,016 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:28:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:28,038 INFO L93 Difference]: Finished difference Result 156 states and 265 transitions. [2025-01-09 11:28:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:28:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 153 [2025-01-09 11:28:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:28,045 INFO L225 Difference]: With dead ends: 156 [2025-01-09 11:28:28,046 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 11:28:28,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:28:28,051 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:28,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:28:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 11:28:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 11:28:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:28:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2025-01-09 11:28:28,085 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 153 [2025-01-09 11:28:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:28,085 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2025-01-09 11:28:28,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:28:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2025-01-09 11:28:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 11:28:28,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:28,091 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:28,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:28:28,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:28:28,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:28,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash -270136843, now seen corresponding path program 1 times [2025-01-09 11:28:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:28,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160916601] [2025-01-09 11:28:28,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:28,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:28,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:28,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:28,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:28:28,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160916601] [2025-01-09 11:28:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160916601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:28,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:28:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86405178] [2025-01-09 11:28:28,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:28,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:28:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:28,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:28:28,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:28:28,458 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:28,525 INFO L93 Difference]: Finished difference Result 228 states and 348 transitions. [2025-01-09 11:28:28,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:28:28,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-01-09 11:28:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:28,527 INFO L225 Difference]: With dead ends: 228 [2025-01-09 11:28:28,527 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 11:28:28,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:28:28,528 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 107 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:28,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 290 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:28:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 11:28:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2025-01-09 11:28:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:28:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2025-01-09 11:28:28,580 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 154 [2025-01-09 11:28:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:28,581 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2025-01-09 11:28:28,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2025-01-09 11:28:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 11:28:28,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:28,587 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:28,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:28:28,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:28,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash 152564983, now seen corresponding path program 1 times [2025-01-09 11:28:28,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:28,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229583043] [2025-01-09 11:28:28,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:28,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:28,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:28,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:28,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:28,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:28:28,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229583043] [2025-01-09 11:28:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229583043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:28,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:28,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:28:28,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779757913] [2025-01-09 11:28:28,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:28,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:28:28,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:28,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:28:28,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:28:28,807 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:28,927 INFO L93 Difference]: Finished difference Result 387 states and 579 transitions. [2025-01-09 11:28:28,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:28:28,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-01-09 11:28:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:28,931 INFO L225 Difference]: With dead ends: 387 [2025-01-09 11:28:28,933 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 11:28:28,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:28:28,934 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 57 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:28,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 371 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:28:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 11:28:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2025-01-09 11:28:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 164 states have internal predecessors, (213), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 11:28:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 349 transitions. [2025-01-09 11:28:28,955 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 349 transitions. Word has length 154 [2025-01-09 11:28:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:28,956 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 349 transitions. [2025-01-09 11:28:28,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 349 transitions. [2025-01-09 11:28:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 11:28:28,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:28,958 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:28,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:28:28,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:28,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1536378759, now seen corresponding path program 1 times [2025-01-09 11:28:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214327290] [2025-01-09 11:28:28,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:28,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:28,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:28,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:28:29,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214327290] [2025-01-09 11:28:29,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214327290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:29,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:29,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:28:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082285406] [2025-01-09 11:28:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:29,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:28:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:29,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:28:29,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:28:29,083 INFO L87 Difference]: Start difference. First operand 235 states and 349 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:29,108 INFO L93 Difference]: Finished difference Result 467 states and 695 transitions. [2025-01-09 11:28:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:28:29,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-01-09 11:28:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:29,112 INFO L225 Difference]: With dead ends: 467 [2025-01-09 11:28:29,112 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 11:28:29,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:28:29,115 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:29,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:28:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 11:28:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-01-09 11:28:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 164 states have internal predecessors, (209), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 11:28:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 345 transitions. [2025-01-09 11:28:29,145 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 345 transitions. Word has length 154 [2025-01-09 11:28:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:29,146 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 345 transitions. [2025-01-09 11:28:29,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 345 transitions. [2025-01-09 11:28:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 11:28:29,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:29,149 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:29,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:28:29,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:29,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:29,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2123184773, now seen corresponding path program 1 times [2025-01-09 11:28:29,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:29,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661245870] [2025-01-09 11:28:29,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:29,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:29,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:29,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:29,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:28:29,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:29,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661245870] [2025-01-09 11:28:29,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661245870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:29,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:29,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:28:29,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346401237] [2025-01-09 11:28:29,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:29,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:28:29,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:29,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:28:29,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:28:29,853 INFO L87 Difference]: Start difference. First operand 235 states and 345 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:30,851 INFO L93 Difference]: Finished difference Result 1554 states and 2240 transitions. [2025-01-09 11:28:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 11:28:30,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-01-09 11:28:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:30,858 INFO L225 Difference]: With dead ends: 1554 [2025-01-09 11:28:30,858 INFO L226 Difference]: Without dead ends: 1322 [2025-01-09 11:28:30,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:28:30,859 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 651 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:30,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 708 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:28:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-01-09 11:28:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 558. [2025-01-09 11:28:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 385 states have (on average 1.2727272727272727) internal successors, (490), 391 states have internal predecessors, (490), 158 states have call successors, (158), 14 states have call predecessors, (158), 14 states have return successors, (158), 152 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 11:28:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 806 transitions. [2025-01-09 11:28:30,947 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 806 transitions. Word has length 154 [2025-01-09 11:28:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:30,948 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 806 transitions. [2025-01-09 11:28:30,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 806 transitions. [2025-01-09 11:28:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 11:28:30,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:30,949 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:30,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:28:30,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:30,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2065926471, now seen corresponding path program 1 times [2025-01-09 11:28:30,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:30,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374395386] [2025-01-09 11:28:30,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:30,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:31,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:31,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:31,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:28:31,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374395386] [2025-01-09 11:28:31,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374395386] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:28:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406893415] [2025-01-09 11:28:31,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:31,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:31,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:31,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:28:31,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:28:31,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:31,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:31,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:31,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:31,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:28:31,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 441 proven. 21 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-01-09 11:28:31,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:28:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:28:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406893415] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:28:31,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:28:31,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 11:28:31,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635067855] [2025-01-09 11:28:31,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:28:31,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:28:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:31,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:28:31,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:28:31,578 INFO L87 Difference]: Start difference. First operand 558 states and 806 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 11:28:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:31,845 INFO L93 Difference]: Finished difference Result 1118 states and 1571 transitions. [2025-01-09 11:28:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:28:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 154 [2025-01-09 11:28:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:31,851 INFO L225 Difference]: With dead ends: 1118 [2025-01-09 11:28:31,851 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 11:28:31,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:28:31,853 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 70 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:31,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 199 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:28:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 11:28:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 556. [2025-01-09 11:28:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 393 states have (on average 1.2366412213740459) internal successors, (486), 399 states have internal predecessors, (486), 142 states have call successors, (142), 20 states have call predecessors, (142), 20 states have return successors, (142), 136 states have call predecessors, (142), 142 states have call successors, (142) [2025-01-09 11:28:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 770 transitions. [2025-01-09 11:28:31,910 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 770 transitions. Word has length 154 [2025-01-09 11:28:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:31,910 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 770 transitions. [2025-01-09 11:28:31,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 11:28:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 770 transitions. [2025-01-09 11:28:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 11:28:31,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:31,912 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:31,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 11:28:32,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:32,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:32,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1419694199, now seen corresponding path program 1 times [2025-01-09 11:28:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503062732] [2025-01-09 11:28:32,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:32,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:32,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:32,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:32,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:28:32,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386927534] [2025-01-09 11:28:32,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:32,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:32,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:32,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:28:32,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 11:28:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:32,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:32,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:32,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:28:32,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:28:32,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 11:28:32,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 11:28:32,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:32,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:28:32,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:28:32,553 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:28:32,554 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:28:32,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 11:28:32,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:32,759 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:32,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:28:32,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:28:32 BoogieIcfgContainer [2025-01-09 11:28:32,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:28:32,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:28:32,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:28:32,870 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:28:32,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:27" (3/4) ... [2025-01-09 11:28:32,875 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:28:32,876 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:28:32,877 INFO L158 Benchmark]: Toolchain (without parser) took 6267.92ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 107.1MB in the beginning and 141.6MB in the end (delta: -34.5MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. [2025-01-09 11:28:32,877 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:28:32,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.73ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 91.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:28:32,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.38ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 86.5MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:28:32,878 INFO L158 Benchmark]: Boogie Preprocessor took 60.95ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 79.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:28:32,878 INFO L158 Benchmark]: RCFGBuilder took 448.49ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 53.0MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:28:32,878 INFO L158 Benchmark]: TraceAbstraction took 5425.94ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 53.0MB in the beginning and 141.7MB in the end (delta: -88.7MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2025-01-09 11:28:32,878 INFO L158 Benchmark]: Witness Printer took 5.96ms. Allocated memory is still 310.4MB. Free memory was 141.7MB in the beginning and 141.6MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:28:32,880 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.73ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 91.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.38ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 86.5MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.95ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 79.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 448.49ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 53.0MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5425.94ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 53.0MB in the beginning and 141.7MB in the end (delta: -88.7MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 5.96ms. Allocated memory is still 310.4MB. Free memory was 141.7MB in the beginning and 141.6MB in the end (delta: 97.0kB). 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 170, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 170. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned char var_1_33 = 8; [L42] unsigned long int var_1_34 = 50; [L43] double var_1_35 = 31.1; [L44] double var_1_36 = 127.4; [L45] unsigned long int var_1_37 = 64; [L46] signed long int var_1_38 = 8; [L47] float var_1_39 = 200.6; [L48] unsigned short int var_1_40 = 2; [L49] signed char var_1_42 = -4; [L50] double var_1_43 = 2.75; [L51] double var_1_44 = 7.6; [L52] signed char var_1_45 = 32; [L53] unsigned long int var_1_46 = 32; [L54] signed long int var_1_47 = -256; [L55] unsigned char last_1_var_1_9 = 1; [L56] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L174] isInitial = 1 [L175] FCALL initially() [L177] CALL updateLastVariables() [L166] last_1_var_1_9 = var_1_9 [L167] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_short() [L131] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L131] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L132] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L134] var_1_8 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L135] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L137] var_1_10 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L140] var_1_11 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L146] var_1_20 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L148] var_1_28 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L151] var_1_29 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L154] var_1_33 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L159] var_1_39 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L162] var_1_44 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L178] RET updateVariables() [L179] CALL step() [L60] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L67] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L69] COND TRUE var_1_9 || var_1_9 [L70] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L72] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L73] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L74] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L76] COND FALSE !(var_1_9 && var_1_9) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L79] var_1_35 = var_1_36 [L80] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L81] COND FALSE !((var_1_9 && var_1_9) && (var_1_26 > var_1_21)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L84] EXPR var_1_21 | var_1_26 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L84] COND FALSE !(var_1_28 > (var_1_21 | var_1_26)) [L87] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L90] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L92] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L93] COND FALSE !((((((var_1_36 / var_1_39)) > (var_1_24)) ? ((var_1_36 / var_1_39)) : (var_1_24))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L98] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L99] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L102] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L106] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L107] var_1_46 = var_1_33 [L108] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L109] COND FALSE !(var_1_28 > var_1_26) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L114] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L115] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L116] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L120] COND FALSE !(var_1_26 > ((var_1_29 >> 1) + var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L123] var_1_47 = var_1_21 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=23370, var_1_4=1, var_1_8=0, var_1_9=0] [L124] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=23370, var_1_4=1, var_1_8=0, var_1_9=0] [L127] var_1_45 = var_1_28 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=23370, var_1_4=1, var_1_8=0, var_1_9=0] [L179] RET step() [L180] CALL, EXPR property() [L170-L171] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=23370, var_1_4=1, var_1_8=0, var_1_9=0] [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=23370, var_1_4=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=23370, var_1_4=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 899 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 885 mSDsluCounter, 1914 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1084 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 771 IncrementalHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 830 mSDtfsCounter, 771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=558occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 850 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1538 NumberOfCodeBlocks, 1538 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 2688 SizeOfPredicates, 4 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 8211/8316 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 11:28:32,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a5a79563eebf4c0adb85c657f2e56816668e0af593ca846b35361e1efa1ac928 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:28:34,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:28:34,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:28:34,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:28:34,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:28:34,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:28:34,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:28:34,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:28:34,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:28:34,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:28:34,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:28:34,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:28:34,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:28:34,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:28:34,908 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:28:34,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:28:34,909 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:28:34,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:28:34,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:34,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:34,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:28:34,911 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:28:34,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:28:34,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:28:34,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:28:34,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:28:34,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> a5a79563eebf4c0adb85c657f2e56816668e0af593ca846b35361e1efa1ac928 [2025-01-09 11:28:35,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:28:35,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:28:35,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:28:35,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:28:35,190 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:28:35,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2025-01-09 11:28:36,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f824b34f/a49578168a5241ec9742f45ef1ec9983/FLAGe0c47dfda [2025-01-09 11:28:36,642 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:28:36,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2025-01-09 11:28:36,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f824b34f/a49578168a5241ec9742f45ef1ec9983/FLAGe0c47dfda [2025-01-09 11:28:36,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f824b34f/a49578168a5241ec9742f45ef1ec9983 [2025-01-09 11:28:36,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:28:36,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:28:36,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:28:36,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:28:36,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:28:36,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18aed096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36, skipping insertion in model container [2025-01-09 11:28:36,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:28:36,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i[919,932] [2025-01-09 11:28:36,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:28:36,880 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:28:36,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i[919,932] [2025-01-09 11:28:36,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:28:36,925 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:28:36,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36 WrapperNode [2025-01-09 11:28:36,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:28:36,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:28:36,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:28:36,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:28:36,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,959 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-01-09 11:28:36,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:28:36,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:28:36,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:28:36,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:28:36,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,979 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]. [2025-01-09 11:28:36,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:36,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:37,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:37,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:37,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:37,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:28:37,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:28:37,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:28:37,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:28:37,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (1/1) ... [2025-01-09 11:28:37,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:37,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:37,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:28:37,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:28:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:28:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:28:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:28:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:28:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:28:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:28:37,122 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:28:37,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:28:45,914 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:28:45,914 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:28:45,921 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:28:45,922 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:28:45,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:45 BoogieIcfgContainer [2025-01-09 11:28:45,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:28:45,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:28:45,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:28:45,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:28:45,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:28:36" (1/3) ... [2025-01-09 11:28:45,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e38b210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:28:45, skipping insertion in model container [2025-01-09 11:28:45,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:36" (2/3) ... [2025-01-09 11:28:45,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e38b210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:28:45, skipping insertion in model container [2025-01-09 11:28:45,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:45" (3/3) ... [2025-01-09 11:28:45,930 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2025-01-09 11:28:45,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:28:45,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:28:46,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:28:46,019 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;@6d4fdc72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:28:46,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:28:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:28:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 11:28:46,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:46,034 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:46,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:46,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:46,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1416256924, now seen corresponding path program 1 times [2025-01-09 11:28:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:28:46,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913204789] [2025-01-09 11:28:46,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:46,046 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 [2025-01-09 11:28:46,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:28:46,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:28:46,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:46,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 11:28:46,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 11:28:46,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:46,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:46,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:28:46,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 11:28:46,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:28:46,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:28:46,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913204789] [2025-01-09 11:28:46,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913204789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:46,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:46,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:28:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67305656] [2025-01-09 11:28:46,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:46,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:28:46,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:28:46,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:28:46,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:28:46,931 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:28:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:46,959 INFO L93 Difference]: Finished difference Result 150 states and 255 transitions. [2025-01-09 11:28:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:28:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2025-01-09 11:28:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:46,964 INFO L225 Difference]: With dead ends: 150 [2025-01-09 11:28:46,965 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 11:28:46,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:28:46,969 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:46,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:28:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 11:28:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-09 11:28:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:28:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-01-09 11:28:46,994 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 152 [2025-01-09 11:28:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-01-09 11:28:46,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:28:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-01-09 11:28:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 11:28:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:46,997 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:47,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:47,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:47,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:47,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1903433361, now seen corresponding path program 1 times [2025-01-09 11:28:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:28:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490266444] [2025-01-09 11:28:47,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:47,203 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 [2025-01-09 11:28:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:28:47,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:28:47,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:47,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 11:28:47,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 11:28:47,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:47,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:47,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 11:28:47,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 453 proven. 39 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 11:28:49,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:28:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:28:51,698 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:28:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490266444] [2025-01-09 11:28:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490266444] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:28:51,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:28:51,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-01-09 11:28:51,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344865710] [2025-01-09 11:28:51,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:28:51,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:28:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:28:51,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:28:51,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:28:51,702 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 11:28:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:56,131 INFO L93 Difference]: Finished difference Result 231 states and 339 transitions. [2025-01-09 11:28:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:28:56,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 153 [2025-01-09 11:28:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:56,137 INFO L225 Difference]: With dead ends: 231 [2025-01-09 11:28:56,137 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 11:28:56,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-01-09 11:28:56,139 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 233 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:56,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 326 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 11:28:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 11:28:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2025-01-09 11:28:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:28:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 213 transitions. [2025-01-09 11:28:56,157 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 213 transitions. Word has length 153 [2025-01-09 11:28:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:56,157 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 213 transitions. [2025-01-09 11:28:56,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 11:28:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 213 transitions. [2025-01-09 11:28:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 11:28:56,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:56,159 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:56,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:56,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:56,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:56,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash -908359795, now seen corresponding path program 1 times [2025-01-09 11:28:56,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:28:56,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524952864] [2025-01-09 11:28:56,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:56,365 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 [2025-01-09 11:28:56,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:28:56,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:28:56,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:56,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 11:28:57,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 11:28:57,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:57,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:57,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:28:57,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:28:57,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:28:57,231 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:28:57,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524952864] [2025-01-09 11:28:57,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524952864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:57,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:57,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:28:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870457605] [2025-01-09 11:28:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:57,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:28:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:28:57,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:28:57,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:28:57,232 INFO L87 Difference]: Start difference. First operand 149 states and 213 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:57,438 INFO L93 Difference]: Finished difference Result 295 states and 423 transitions. [2025-01-09 11:28:57,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:28:57,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-01-09 11:28:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:57,449 INFO L225 Difference]: With dead ends: 295 [2025-01-09 11:28:57,450 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 11:28:57,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:28:57,451 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:57,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:28:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 11:28:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-01-09 11:28:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:28:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 211 transitions. [2025-01-09 11:28:57,462 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 211 transitions. Word has length 153 [2025-01-09 11:28:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:57,463 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 211 transitions. [2025-01-09 11:28:57,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:28:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2025-01-09 11:28:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 11:28:57,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:57,464 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:57,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 11:28:57,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:57,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1495165809, now seen corresponding path program 1 times [2025-01-09 11:28:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:28:57,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467916277] [2025-01-09 11:28:57,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:57,670 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 [2025-01-09 11:28:57,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:28:57,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:28:57,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 11:28:57,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 11:28:58,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 11:28:58,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:58,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:58,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:28:58,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:29:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 441 proven. 21 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-01-09 11:29:00,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:29:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:29:03,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:29:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467916277] [2025-01-09 11:29:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467916277] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:29:03,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:29:03,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-01-09 11:29:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385859452] [2025-01-09 11:29:03,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:29:03,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:29:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:29:03,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:29:03,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:29:03,079 INFO L87 Difference]: Start difference. First operand 149 states and 211 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 11:29:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:29:11,087 INFO L93 Difference]: Finished difference Result 468 states and 637 transitions. [2025-01-09 11:29:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:29:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 153 [2025-01-09 11:29:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:29:11,093 INFO L225 Difference]: With dead ends: 468 [2025-01-09 11:29:11,094 INFO L226 Difference]: Without dead ends: 322 [2025-01-09 11:29:11,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2025-01-09 11:29:11,096 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 176 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:29:11,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 234 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-01-09 11:29:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-09 11:29:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 165. [2025-01-09 11:29:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.1875) internal successors, (133), 112 states have internal predecessors, (133), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:29:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2025-01-09 11:29:11,127 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 153 [2025-01-09 11:29:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:29:11,128 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2025-01-09 11:29:11,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 11:29:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2025-01-09 11:29:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 11:29:11,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:29:11,129 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:29:11,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 11:29:11,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:29:11,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:29:11,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:29:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1990454861, now seen corresponding path program 1 times [2025-01-09 11:29:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:29:11,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025200508] [2025-01-09 11:29:11,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:29:11,336 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 [2025-01-09 11:29:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:29:11,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:29:11,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 11:29:11,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 11:29:12,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 11:29:12,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:29:12,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:29:12,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 11:29:12,092 INFO L279 TraceCheckSpWp]: Computing forward predicates...