./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.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_fillercodesize_ps-cn-25_file-11.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 f51ee4a7220dc2b51ff1b4163bfc3c5ced88b90b523c25a3c78fe5519978425e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:50:03,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:50:03,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:50:03,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:50:03,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:50:03,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:50:03,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:50:03,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:50:03,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:50:03,442 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:50:03,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:50:03,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:50:03,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:50:03,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:50:03,444 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:50:03,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:50:03,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:50:03,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:50:03,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:50:03,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:50:03,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:50:03,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:50:03,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:50:03,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:50:03,446 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:50:03,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:50:03,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:50:03,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:50:03,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:50:03,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:50:03,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:50:03,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:50:03,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:50:03,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:50:03,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:50:03,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:50:03,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:50:03,449 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 -> f51ee4a7220dc2b51ff1b4163bfc3c5ced88b90b523c25a3c78fe5519978425e [2025-01-09 09:50:03,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:50:03,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:50:03,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:50:03,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:50:03,764 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:50:03,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2025-01-09 09:50:05,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/517ae7e9d/2d95e1a5296a4618a97cfbb4714490e5/FLAG50a8512ee [2025-01-09 09:50:05,369 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:50:05,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2025-01-09 09:50:05,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/517ae7e9d/2d95e1a5296a4618a97cfbb4714490e5/FLAG50a8512ee [2025-01-09 09:50:05,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/517ae7e9d/2d95e1a5296a4618a97cfbb4714490e5 [2025-01-09 09:50:05,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:50:05,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:50:05,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:50:05,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:50:05,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:50:05,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d702e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05, skipping insertion in model container [2025-01-09 09:50:05,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:50:05,579 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_fillercodesize_ps-cn-25_file-11.i[915,928] [2025-01-09 09:50:05,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:50:05,672 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:50:05,682 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_fillercodesize_ps-cn-25_file-11.i[915,928] [2025-01-09 09:50:05,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:50:05,754 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:50:05,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05 WrapperNode [2025-01-09 09:50:05,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:50:05,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:50:05,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:50:05,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:50:05,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,811 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-01-09 09:50:05,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:50:05,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:50:05,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:50:05,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:50:05,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,840 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 09:50:05,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:50:05,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:50:05,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:50:05,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:50:05,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (1/1) ... [2025-01-09 09:50:05,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:50:05,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:50:05,892 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 09:50:05,896 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 09:50:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:50:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:50:05,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:50:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:50:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:50:05,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:50:06,007 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:50:06,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:50:06,353 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:50:06,353 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:50:06,363 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:50:06,363 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:50:06,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:50:06 BoogieIcfgContainer [2025-01-09 09:50:06,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:50:06,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:50:06,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:50:06,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:50:06,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:50:05" (1/3) ... [2025-01-09 09:50:06,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82b6d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:50:06, skipping insertion in model container [2025-01-09 09:50:06,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:05" (2/3) ... [2025-01-09 09:50:06,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82b6d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:50:06, skipping insertion in model container [2025-01-09 09:50:06,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:50:06" (3/3) ... [2025-01-09 09:50:06,373 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2025-01-09 09:50:06,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:50:06,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-11.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:50:06,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:50:06,463 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;@566f0dfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:50:06,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:50:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 09:50:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 09:50:06,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:06,484 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:06,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:06,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1734812381, now seen corresponding path program 1 times [2025-01-09 09:50:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:50:06,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000671276] [2025-01-09 09:50:06,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:50:06,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 09:50:06,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 09:50:06,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:06,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 09:50:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:50:07,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000671276] [2025-01-09 09:50:07,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000671276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:50:07,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:50:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:50:07,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986675786] [2025-01-09 09:50:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:50:07,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:50:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:50:07,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:50:07,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:50:07,053 INFO L87 Difference]: Start difference. First operand has 76 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:07,112 INFO L93 Difference]: Finished difference Result 190 states and 348 transitions. [2025-01-09 09:50:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:50:07,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 154 [2025-01-09 09:50:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:07,124 INFO L225 Difference]: With dead ends: 190 [2025-01-09 09:50:07,125 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 09:50:07,128 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 09:50:07,132 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 107 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:07,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 241 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:50:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 09:50:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2025-01-09 09:50:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 09:50:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2025-01-09 09:50:07,181 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 154 [2025-01-09 09:50:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:07,183 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2025-01-09 09:50:07,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2025-01-09 09:50:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 09:50:07,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:07,186 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:07,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 09:50:07,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:07,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1692330160, now seen corresponding path program 1 times [2025-01-09 09:50:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:50:07,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073832702] [2025-01-09 09:50:07,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:50:07,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 09:50:07,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 09:50:07,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:07,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 09:50:07,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:50:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073832702] [2025-01-09 09:50:07,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073832702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:50:07,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:50:07,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:50:07,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149889544] [2025-01-09 09:50:07,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:50:07,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:50:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:50:07,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:50:07,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:50:07,404 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:07,450 INFO L93 Difference]: Finished difference Result 195 states and 297 transitions. [2025-01-09 09:50:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:50:07,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2025-01-09 09:50:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:07,456 INFO L225 Difference]: With dead ends: 195 [2025-01-09 09:50:07,457 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 09:50:07,457 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 09:50:07,459 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 81 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:07,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:50:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 09:50:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2025-01-09 09:50:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 79 states have internal predecessors, (103), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 09:50:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 185 transitions. [2025-01-09 09:50:07,489 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 185 transitions. Word has length 155 [2025-01-09 09:50:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:07,492 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 185 transitions. [2025-01-09 09:50:07,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 185 transitions. [2025-01-09 09:50:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 09:50:07,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:07,496 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:07,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:50:07,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:07,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1940634360, now seen corresponding path program 1 times [2025-01-09 09:50:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:50:07,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652704374] [2025-01-09 09:50:07,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:50:07,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 09:50:07,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 09:50:07,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 09:50:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:50:08,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652704374] [2025-01-09 09:50:08,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652704374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:50:08,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:50:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:50:08,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901854784] [2025-01-09 09:50:08,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:50:08,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:50:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:50:08,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:50:08,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:50:08,334 INFO L87 Difference]: Start difference. First operand 122 states and 185 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:08,411 INFO L93 Difference]: Finished difference Result 263 states and 396 transitions. [2025-01-09 09:50:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:50:08,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2025-01-09 09:50:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:08,415 INFO L225 Difference]: With dead ends: 263 [2025-01-09 09:50:08,415 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 09:50:08,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:50:08,417 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 32 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:08,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 295 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:50:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 09:50:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2025-01-09 09:50:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 87 states have internal predecessors, (115), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 09:50:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 197 transitions. [2025-01-09 09:50:08,440 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 197 transitions. Word has length 155 [2025-01-09 09:50:08,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:08,440 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 197 transitions. [2025-01-09 09:50:08,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 197 transitions. [2025-01-09 09:50:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 09:50:08,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:08,445 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:50:08,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1942481402, now seen corresponding path program 1 times [2025-01-09 09:50:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:50:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798035395] [2025-01-09 09:50:08,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:50:08,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 09:50:08,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 09:50:08,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:08,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 09:50:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:50:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798035395] [2025-01-09 09:50:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798035395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:50:08,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:50:08,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:50:08,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282591848] [2025-01-09 09:50:08,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:50:08,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:50:08,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:50:08,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:50:08,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:50:08,798 INFO L87 Difference]: Start difference. First operand 130 states and 197 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:09,042 INFO L93 Difference]: Finished difference Result 359 states and 543 transitions. [2025-01-09 09:50:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:50:09,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2025-01-09 09:50:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:09,046 INFO L225 Difference]: With dead ends: 359 [2025-01-09 09:50:09,048 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 09:50:09,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:50:09,051 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:09,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 362 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:50:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 09:50:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2025-01-09 09:50:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 120 states have (on average 1.2833333333333334) internal successors, (154), 121 states have internal predecessors, (154), 65 states have call successors, (65), 4 states have call predecessors, (65), 4 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 09:50:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2025-01-09 09:50:09,098 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 155 [2025-01-09 09:50:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:09,100 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2025-01-09 09:50:09,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2025-01-09 09:50:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 09:50:09,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:09,102 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:09,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:50:09,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:09,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1498029247, now seen corresponding path program 1 times [2025-01-09 09:50:09,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:50:09,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337915167] [2025-01-09 09:50:09,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:09,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:50:09,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 09:50:09,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 09:50:09,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:09,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 09:50:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:50:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337915167] [2025-01-09 09:50:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337915167] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:50:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176679025] [2025-01-09 09:50:09,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:09,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:50:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:50:09,686 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 09:50:09,688 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 09:50:09,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 09:50:09,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 09:50:09,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:09,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:09,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:50:09,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:50:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2025-01-09 09:50:10,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:50:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 09:50:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176679025] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:50:10,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:50:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 09:50:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284123478] [2025-01-09 09:50:10,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:50:10,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:50:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:50:10,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:50:10,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:50:10,566 INFO L87 Difference]: Start difference. First operand 190 states and 284 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 09:50:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:10,873 INFO L93 Difference]: Finished difference Result 335 states and 489 transitions. [2025-01-09 09:50:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:50:10,874 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 156 [2025-01-09 09:50:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:10,878 INFO L225 Difference]: With dead ends: 335 [2025-01-09 09:50:10,879 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 09:50:10,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:50:10,881 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 184 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:10,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 183 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:50:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 09:50:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2025-01-09 09:50:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 122 states have internal predecessors, (147), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 09:50:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 277 transitions. [2025-01-09 09:50:10,921 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 277 transitions. Word has length 156 [2025-01-09 09:50:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:10,922 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 277 transitions. [2025-01-09 09:50:10,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 09:50:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 277 transitions. [2025-01-09 09:50:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 09:50:10,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:10,926 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:10,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:50:11,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:50:11,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:11,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash -130446093, now seen corresponding path program 1 times [2025-01-09 09:50:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:50:11,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351896125] [2025-01-09 09:50:11,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:50:11,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 09:50:11,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 09:50:11,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:11,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:50:11,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:50:11,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 09:50:11,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 09:50:11,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:11,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:50:11,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:50:11,472 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:50:11,473 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:50:11,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:50:11,477 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 09:50:11,605 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:50:11,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:50:11 BoogieIcfgContainer [2025-01-09 09:50:11,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:50:11,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:50:11,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:50:11,608 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:50:11,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:50:06" (3/4) ... [2025-01-09 09:50:11,611 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:50:11,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:50:11,612 INFO L158 Benchmark]: Toolchain (without parser) took 6194.18ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 112.1MB in the beginning and 145.3MB in the end (delta: -33.2MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-01-09 09:50:11,612 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:50:11,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.17ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:50:11,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.76ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:50:11,614 INFO L158 Benchmark]: Boogie Preprocessor took 43.46ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:50:11,614 INFO L158 Benchmark]: RCFGBuilder took 507.27ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 72.2MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:50:11,614 INFO L158 Benchmark]: TraceAbstraction took 5241.38ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 71.7MB in the beginning and 145.3MB in the end (delta: -73.6MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2025-01-09 09:50:11,615 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 192.9MB. Free memory was 145.3MB in the beginning and 145.3MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:50:11,616 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.42ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.17ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.76ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.46ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 507.27ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 72.2MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5241.38ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 71.7MB in the beginning and 145.3MB in the end (delta: -73.6MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 192.9MB. Free memory was 145.3MB in the beginning and 145.3MB in the end (delta: 33.1kB). 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 153, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 148. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] signed long int var_1_24 = 16; [L42] signed char var_1_25 = 5; [L43] signed long int var_1_26 = -4; [L44] unsigned char var_1_27 = 0; [L45] signed short int var_1_28 = -16; [L46] float var_1_29 = 99999999.5; [L47] float var_1_30 = 24.63; [L48] float var_1_31 = 49.4; [L49] unsigned char var_1_32 = 1; [L50] unsigned long int last_1_var_1_10 = 128; [L51] unsigned long int last_1_var_1_16 = 1; [L52] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=0, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L172] isInitial = 1 [L173] FCALL initially() [L175] CALL updateLastVariables() [L163] last_1_var_1_10 = var_1_10 [L164] last_1_var_1_16 = var_1_16 [L165] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=0, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L123] var_1_2 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L124] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L125] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L125] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L126] var_1_3 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L127] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L128] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L129] var_1_7 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L130] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L131] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L132] var_1_8 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L133] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L134] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L135] var_1_9 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L136] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L137] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L138] var_1_11 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L139] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L140] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L141] var_1_17 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L142] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L143] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L144] var_1_18 = __VERIFIER_nondet_ulong() [L145] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L145] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L146] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L147] var_1_20 = __VERIFIER_nondet_double() [L148] 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_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L148] 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_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L149] var_1_27 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L150] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L151] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L152] var_1_29 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L153] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L154] var_1_30 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L155] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L156] var_1_31 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L157] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L158] var_1_32 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] RET updateVariables() [L177] CALL step() [L56] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) [L57] var_1_23 = 8 [L58] var_1_24 = var_1_22 [L59] var_1_25 = 32 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L60] COND TRUE var_1_25 > 1 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L61] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L67] COND TRUE ! var_1_27 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] COND FALSE !((var_1_29 * var_1_30) > var_1_31) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L80] unsigned long int stepLocal_1 = last_1_var_1_16; [L81] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L82] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L83] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L91] COND TRUE var_1_12 == var_1_12 [L92] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L94] var_1_1 = (var_1_2 || (! var_1_3)) [L95] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L96] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L97] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L98] COND FALSE !(var_1_19 >= var_1_19) [L103] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L108] COND TRUE var_1_19 != var_1_19 [L109] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L117] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L118] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L119] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L177] RET step() [L178] CALL, EXPR property() [L168-L169] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 506 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 482 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 718 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 569 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 117 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1080 ConstructedInterpolants, 0 QuantifiedInterpolants, 2339 SizeOfPredicates, 3 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 7548/7728 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 09:50:11,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_fillercodesize_ps-cn-25_file-11.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 f51ee4a7220dc2b51ff1b4163bfc3c5ced88b90b523c25a3c78fe5519978425e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:50:13,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:50:14,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:50:14,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:50:14,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:50:14,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:50:14,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:50:14,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:50:14,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:50:14,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:50:14,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:50:14,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:50:14,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:50:14,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:50:14,051 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:50:14,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:50:14,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:50:14,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:50:14,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:50:14,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:50:14,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:50:14,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:50:14,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:50:14,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:50:14,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:50:14,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:50:14,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:50:14,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:50:14,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:50:14,054 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 -> f51ee4a7220dc2b51ff1b4163bfc3c5ced88b90b523c25a3c78fe5519978425e [2025-01-09 09:50:14,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:50:14,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:50:14,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:50:14,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:50:14,376 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:50:14,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2025-01-09 09:50:15,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a77872382/7c39c0aa8a734791be23db9907fe1ab3/FLAG493b1591c [2025-01-09 09:50:16,013 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:50:16,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2025-01-09 09:50:16,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a77872382/7c39c0aa8a734791be23db9907fe1ab3/FLAG493b1591c [2025-01-09 09:50:16,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a77872382/7c39c0aa8a734791be23db9907fe1ab3 [2025-01-09 09:50:16,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:50:16,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:50:16,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:50:16,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:50:16,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:50:16,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30110529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16, skipping insertion in model container [2025-01-09 09:50:16,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:50:16,531 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_fillercodesize_ps-cn-25_file-11.i[915,928] [2025-01-09 09:50:16,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:50:16,611 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:50:16,620 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_fillercodesize_ps-cn-25_file-11.i[915,928] [2025-01-09 09:50:16,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:50:16,671 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:50:16,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16 WrapperNode [2025-01-09 09:50:16,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:50:16,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:50:16,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:50:16,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:50:16,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,716 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-01-09 09:50:16,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:50:16,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:50:16,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:50:16,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:50:16,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,742 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 09:50:16,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:50:16,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:50:16,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:50:16,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:50:16,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (1/1) ... [2025-01-09 09:50:16,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:50:16,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:50:16,801 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 09:50:16,807 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 09:50:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:50:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:50:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:50:16,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:50:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:50:16,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:50:16,900 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:50:16,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:50:17,653 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:50:17,653 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:50:17,666 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:50:17,667 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:50:17,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:50:17 BoogieIcfgContainer [2025-01-09 09:50:17,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:50:17,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:50:17,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:50:17,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:50:17,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:50:16" (1/3) ... [2025-01-09 09:50:17,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c395cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:50:17, skipping insertion in model container [2025-01-09 09:50:17,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:16" (2/3) ... [2025-01-09 09:50:17,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c395cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:50:17, skipping insertion in model container [2025-01-09 09:50:17,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:50:17" (3/3) ... [2025-01-09 09:50:17,681 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2025-01-09 09:50:17,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:50:17,697 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-11.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:50:17,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:50:17,753 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;@69024b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:50:17,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:50:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 09:50:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 09:50:17,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:17,768 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:17,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1734812381, now seen corresponding path program 1 times [2025-01-09 09:50:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:50:17,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169400936] [2025-01-09 09:50:17,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:17,783 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 09:50:17,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:50:17,787 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 09:50:17,788 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 09:50:17,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 09:50:18,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 09:50:18,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:18,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:18,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:50:18,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:50:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 09:50:18,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:50:18,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:50:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169400936] [2025-01-09 09:50:18,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169400936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:50:18,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:50:18,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:50:18,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562856248] [2025-01-09 09:50:18,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:50:18,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:50:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:50:18,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:50:18,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:50:18,220 INFO L87 Difference]: Start difference. First operand has 76 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:18,318 INFO L93 Difference]: Finished difference Result 190 states and 348 transitions. [2025-01-09 09:50:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:50:18,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 154 [2025-01-09 09:50:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:18,330 INFO L225 Difference]: With dead ends: 190 [2025-01-09 09:50:18,330 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 09:50:18,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 152 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 09:50:18,337 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 107 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:18,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 241 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:50:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 09:50:18,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2025-01-09 09:50:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 09:50:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2025-01-09 09:50:18,399 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 154 [2025-01-09 09:50:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:18,402 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2025-01-09 09:50:18,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2025-01-09 09:50:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 09:50:18,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:18,406 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:18,415 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 09:50:18,607 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 09:50:18,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:18,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1692330160, now seen corresponding path program 1 times [2025-01-09 09:50:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:50:18,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655337961] [2025-01-09 09:50:18,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:18,609 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 09:50:18,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:50:18,612 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 09:50:18,613 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 09:50:18,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 09:50:18,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 09:50:18,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:18,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:18,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:50:18,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:50:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 09:50:18,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:50:18,898 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:50:18,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655337961] [2025-01-09 09:50:18,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655337961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:50:18,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:50:18,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:50:18,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214111384] [2025-01-09 09:50:18,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:50:18,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:50:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:50:18,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:50:18,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:50:18,902 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:18,959 INFO L93 Difference]: Finished difference Result 195 states and 297 transitions. [2025-01-09 09:50:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:50:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2025-01-09 09:50:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:18,964 INFO L225 Difference]: With dead ends: 195 [2025-01-09 09:50:18,965 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 09:50:18,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 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 09:50:18,967 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 81 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:18,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:50:18,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 09:50:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2025-01-09 09:50:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 79 states have internal predecessors, (103), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 09:50:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 185 transitions. [2025-01-09 09:50:18,992 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 185 transitions. Word has length 155 [2025-01-09 09:50:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:18,993 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 185 transitions. [2025-01-09 09:50:18,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 185 transitions. [2025-01-09 09:50:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 09:50:18,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:18,995 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:19,002 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 09:50:19,196 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 09:50:19,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:19,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1940634360, now seen corresponding path program 1 times [2025-01-09 09:50:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:50:19,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784559856] [2025-01-09 09:50:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:19,199 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 09:50:19,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:50:19,202 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 09:50:19,204 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 09:50:19,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 09:50:19,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 09:50:19,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:19,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:19,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:50:19,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:50:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 09:50:20,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:50:20,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:50:20,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784559856] [2025-01-09 09:50:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784559856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:50:20,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:50:20,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:50:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102429914] [2025-01-09 09:50:20,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:50:20,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:50:20,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:50:20,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:50:20,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:50:20,360 INFO L87 Difference]: Start difference. First operand 122 states and 185 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:20,766 INFO L93 Difference]: Finished difference Result 335 states and 507 transitions. [2025-01-09 09:50:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:50:20,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2025-01-09 09:50:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:20,773 INFO L225 Difference]: With dead ends: 335 [2025-01-09 09:50:20,773 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 09:50:20,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:50:20,774 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 75 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:20,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 362 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:50:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 09:50:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2025-01-09 09:50:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 113 states have internal predecessors, (142), 65 states have call successors, (65), 4 states have call predecessors, (65), 4 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 09:50:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 272 transitions. [2025-01-09 09:50:20,804 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 272 transitions. Word has length 155 [2025-01-09 09:50:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:20,806 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 272 transitions. [2025-01-09 09:50:20,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 272 transitions. [2025-01-09 09:50:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 09:50:20,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:20,811 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:20,821 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 09:50:21,011 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 09:50:21,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:21,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1496182205, now seen corresponding path program 1 times [2025-01-09 09:50:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:50:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316363768] [2025-01-09 09:50:21,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:21,013 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 09:50:21,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:50:21,017 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 09:50:21,018 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 09:50:21,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 09:50:21,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 09:50:21,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:21,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:21,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 09:50:21,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:50:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2025-01-09 09:50:21,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:50:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 09:50:21,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:50:21,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316363768] [2025-01-09 09:50:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316363768] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:50:21,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:50:21,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-01-09 09:50:21,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171655641] [2025-01-09 09:50:21,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:50:21,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:50:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:50:21,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:50:21,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:50:21,892 INFO L87 Difference]: Start difference. First operand 182 states and 272 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 09:50:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:22,346 INFO L93 Difference]: Finished difference Result 327 states and 477 transitions. [2025-01-09 09:50:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:50:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 156 [2025-01-09 09:50:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:22,353 INFO L225 Difference]: With dead ends: 327 [2025-01-09 09:50:22,354 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 09:50:22,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:50:22,357 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 103 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:22,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 182 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:50:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 09:50:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2025-01-09 09:50:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 122 states have internal predecessors, (147), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 09:50:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 277 transitions. [2025-01-09 09:50:22,398 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 277 transitions. Word has length 156 [2025-01-09 09:50:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:22,399 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 277 transitions. [2025-01-09 09:50:22,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 09:50:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 277 transitions. [2025-01-09 09:50:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 09:50:22,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:22,401 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:22,412 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 (5)] Ended with exit code 0 [2025-01-09 09:50:22,602 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 09:50:22,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:22,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash -130446093, now seen corresponding path program 1 times [2025-01-09 09:50:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:50:22,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001046750] [2025-01-09 09:50:22,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:22,604 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 09:50:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:50:22,607 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 09:50:22,608 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 09:50:22,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 09:50:22,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 09:50:22,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:22,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:22,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 09:50:22,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:50:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 09:50:23,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:50:23,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:50:23,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001046750] [2025-01-09 09:50:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001046750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:50:23,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:50:23,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:50:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460734213] [2025-01-09 09:50:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:50:23,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:50:23,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:50:23,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:50:23,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:50:23,218 INFO L87 Difference]: Start difference. First operand 194 states and 277 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:24,302 INFO L93 Difference]: Finished difference Result 329 states and 473 transitions. [2025-01-09 09:50:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:50:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-01-09 09:50:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:24,305 INFO L225 Difference]: With dead ends: 329 [2025-01-09 09:50:24,305 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 09:50:24,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:50:24,306 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 81 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:24,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 252 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:50:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 09:50:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2025-01-09 09:50:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 122 states have internal predecessors, (143), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 09:50:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 273 transitions. [2025-01-09 09:50:24,341 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 273 transitions. Word has length 157 [2025-01-09 09:50:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:24,343 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 273 transitions. [2025-01-09 09:50:24,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 09:50:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 273 transitions. [2025-01-09 09:50:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 09:50:24,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:24,346 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:24,356 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 (6)] Ended with exit code 0 [2025-01-09 09:50:24,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 09:50:24,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:24,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1318665876, now seen corresponding path program 1 times [2025-01-09 09:50:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:50:24,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195924004] [2025-01-09 09:50:24,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:24,548 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 09:50:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:50:24,550 INFO L229 MonitoredProcess]: Starting monitored process 7 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 09:50:24,553 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 (7)] Waiting until timeout for monitored process [2025-01-09 09:50:24,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 09:50:24,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 09:50:24,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:24,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:24,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 09:50:24,775 INFO L279 TraceCheckSpWp]: Computing forward predicates...