./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.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 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:13:06,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:13:06,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:13:06,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:13:06,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:13:06,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:13:06,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:13:06,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:13:06,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:13:06,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:13:06,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:13:06,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:13:06,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:13:06,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:13:06,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:13:06,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:13:06,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:13:06,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:13:06,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:13:06,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:13:06,471 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 -> 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 [2025-01-09 12:13:06,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:13:06,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:13:06,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:13:06,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:13:06,706 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:13:06,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2025-01-09 12:13:07,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5f329aee/bc06971e54f64acaaf3b0d49a5d325d8/FLAGc1730e6a3 [2025-01-09 12:13:08,129 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:13:08,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2025-01-09 12:13:08,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5f329aee/bc06971e54f64acaaf3b0d49a5d325d8/FLAGc1730e6a3 [2025-01-09 12:13:08,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5f329aee/bc06971e54f64acaaf3b0d49a5d325d8 [2025-01-09 12:13:08,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:13:08,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:13:08,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:13:08,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:13:08,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:13:08,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59354560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08, skipping insertion in model container [2025-01-09 12:13:08,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:13:08,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2025-01-09 12:13:08,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:13:08,395 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:13:08,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2025-01-09 12:13:08,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:13:08,437 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:13:08,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08 WrapperNode [2025-01-09 12:13:08,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:13:08,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:13:08,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:13:08,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:13:08,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,488 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 293 [2025-01-09 12:13:08,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:13:08,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:13:08,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:13:08,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:13:08,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,515 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 12:13:08,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:13:08,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:13:08,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:13:08,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:13:08,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (1/1) ... [2025-01-09 12:13:08,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:13:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:13:08,587 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 12:13:08,594 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 12:13:08,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:13:08,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:13:08,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:13:08,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:13:08,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:13:08,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:13:08,690 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:13:08,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:13:09,151 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-09 12:13:09,152 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:13:09,158 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:13:09,159 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:13:09,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:09 BoogieIcfgContainer [2025-01-09 12:13:09,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:13:09,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:13:09,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:13:09,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:13:09,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:13:08" (1/3) ... [2025-01-09 12:13:09,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e50f055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:09, skipping insertion in model container [2025-01-09 12:13:09,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:08" (2/3) ... [2025-01-09 12:13:09,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e50f055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:09, skipping insertion in model container [2025-01-09 12:13:09,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:09" (3/3) ... [2025-01-09 12:13:09,166 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2025-01-09 12:13:09,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:13:09,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:13:09,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:13:09,243 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;@3f6cc7a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:13:09,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:13:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:13:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:13:09,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:09,257 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:09,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:09,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash -761764144, now seen corresponding path program 1 times [2025-01-09 12:13:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533066956] [2025-01-09 12:13:09,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:09,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:13:09,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:13:09,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:09,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 12:13:09,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:09,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533066956] [2025-01-09 12:13:09,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533066956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:13:09,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651781824] [2025-01-09 12:13:09,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:09,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:13:09,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:13:09,571 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 12:13:09,574 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 12:13:09,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:13:09,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:13:09,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:09,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:09,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:13:09,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:13:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 12:13:09,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:13:09,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651781824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:09,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:13:09,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:13:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659953162] [2025-01-09 12:13:09,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:09,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:13:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:09,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:13:09,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:13:09,820 INFO L87 Difference]: Start difference. First operand has 125 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:13:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:09,843 INFO L93 Difference]: Finished difference Result 243 states and 421 transitions. [2025-01-09 12:13:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:13:09,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2025-01-09 12:13:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:09,848 INFO L225 Difference]: With dead ends: 243 [2025-01-09 12:13:09,848 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 12:13:09,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:13:09,852 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:09,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:13:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 12:13:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-01-09 12:13:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:13:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 188 transitions. [2025-01-09 12:13:09,894 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 188 transitions. Word has length 212 [2025-01-09 12:13:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:09,895 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 188 transitions. [2025-01-09 12:13:09,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:13:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 188 transitions. [2025-01-09 12:13:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:13:09,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:09,898 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:09,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:13:10,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:13:10,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1805502306, now seen corresponding path program 1 times [2025-01-09 12:13:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677908511] [2025-01-09 12:13:10,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:10,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:13:10,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:13:10,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:10,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:10,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677908511] [2025-01-09 12:13:10,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677908511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:10,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:10,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:13:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680341906] [2025-01-09 12:13:10,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:10,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:13:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:10,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:13:10,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:13:10,347 INFO L87 Difference]: Start difference. First operand 121 states and 188 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:10,435 INFO L93 Difference]: Finished difference Result 342 states and 533 transitions. [2025-01-09 12:13:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:13:10,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-01-09 12:13:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:10,438 INFO L225 Difference]: With dead ends: 342 [2025-01-09 12:13:10,438 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 12:13:10,439 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 12:13:10,440 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 152 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:10,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 344 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:13:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 12:13:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2025-01-09 12:13:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 states have internal predecessors, (186), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 12:13:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 318 transitions. [2025-01-09 12:13:10,460 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 318 transitions. Word has length 212 [2025-01-09 12:13:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:10,460 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 318 transitions. [2025-01-09 12:13:10,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2025-01-09 12:13:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:13:10,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:10,463 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:13:10,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:10,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1382800480, now seen corresponding path program 1 times [2025-01-09 12:13:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393139709] [2025-01-09 12:13:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:10,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:13:10,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:13:10,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:10,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393139709] [2025-01-09 12:13:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393139709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:10,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:10,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:13:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349299269] [2025-01-09 12:13:10,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:10,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:13:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:10,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:13:10,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:13:10,559 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:10,633 INFO L93 Difference]: Finished difference Result 429 states and 657 transitions. [2025-01-09 12:13:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:13:10,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-01-09 12:13:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:10,636 INFO L225 Difference]: With dead ends: 429 [2025-01-09 12:13:10,636 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 12:13:10,637 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 12:13:10,638 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 174 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:10,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 468 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:13:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 12:13:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2025-01-09 12:13:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 139 states have internal predecessors, (179), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 12:13:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 311 transitions. [2025-01-09 12:13:10,659 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 311 transitions. Word has length 212 [2025-01-09 12:13:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:10,660 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 311 transitions. [2025-01-09 12:13:10,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 311 transitions. [2025-01-09 12:13:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:13:10,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:10,662 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:10,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:13:10,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1632303138, now seen corresponding path program 1 times [2025-01-09 12:13:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126918946] [2025-01-09 12:13:10,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:10,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:13:10,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:13:10,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:10,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:11,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:11,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126918946] [2025-01-09 12:13:11,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126918946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:11,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:11,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:13:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706831533] [2025-01-09 12:13:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:11,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:13:11,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:11,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:13:11,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:13:11,099 INFO L87 Difference]: Start difference. First operand 208 states and 311 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:11,788 INFO L93 Difference]: Finished difference Result 592 states and 892 transitions. [2025-01-09 12:13:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:13:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-01-09 12:13:11,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:11,796 INFO L225 Difference]: With dead ends: 592 [2025-01-09 12:13:11,796 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 12:13:11,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:13:11,797 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 203 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:11,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 656 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:13:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 12:13:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 310. [2025-01-09 12:13:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 207 states have (on average 1.285024154589372) internal successors, (266), 207 states have internal predecessors, (266), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 12:13:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 464 transitions. [2025-01-09 12:13:11,845 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 464 transitions. Word has length 212 [2025-01-09 12:13:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:11,846 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 464 transitions. [2025-01-09 12:13:11,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 464 transitions. [2025-01-09 12:13:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:13:11,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:11,849 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:11,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:13:11,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:11,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1662590649, now seen corresponding path program 1 times [2025-01-09 12:13:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621748225] [2025-01-09 12:13:11,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:11,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:13:11,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:13:11,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:11,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:12,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:12,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621748225] [2025-01-09 12:13:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621748225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:12,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:12,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:13:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574526055] [2025-01-09 12:13:12,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:12,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:13:12,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:12,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:13:12,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:13:12,358 INFO L87 Difference]: Start difference. First operand 310 states and 464 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:12,685 INFO L93 Difference]: Finished difference Result 738 states and 1099 transitions. [2025-01-09 12:13:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:13:12,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-01-09 12:13:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:12,689 INFO L225 Difference]: With dead ends: 738 [2025-01-09 12:13:12,689 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 12:13:12,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:13:12,690 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 188 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:12,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 612 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:13:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 12:13:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 415. [2025-01-09 12:13:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 278 states have (on average 1.2697841726618706) internal successors, (353), 278 states have internal predecessors, (353), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 12:13:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 617 transitions. [2025-01-09 12:13:12,724 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 617 transitions. Word has length 213 [2025-01-09 12:13:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:12,724 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 617 transitions. [2025-01-09 12:13:12,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 617 transitions. [2025-01-09 12:13:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 12:13:12,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:12,726 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:12,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:13:12,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:12,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1632525736, now seen corresponding path program 1 times [2025-01-09 12:13:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:12,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76207661] [2025-01-09 12:13:12,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:12,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 12:13:12,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 12:13:12,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:12,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76207661] [2025-01-09 12:13:12,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76207661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:12,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:12,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:13:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152083886] [2025-01-09 12:13:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:12,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:13:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:12,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:13:12,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:13:12,874 INFO L87 Difference]: Start difference. First operand 415 states and 617 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:12,901 INFO L93 Difference]: Finished difference Result 621 states and 927 transitions. [2025-01-09 12:13:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:13:12,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 12:13:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:12,904 INFO L225 Difference]: With dead ends: 621 [2025-01-09 12:13:12,904 INFO L226 Difference]: Without dead ends: 416 [2025-01-09 12:13:12,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:13:12,905 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:12,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:13:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-09 12:13:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-01-09 12:13:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 279 states have (on average 1.2688172043010753) internal successors, (354), 279 states have internal predecessors, (354), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 12:13:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 618 transitions. [2025-01-09 12:13:12,936 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 618 transitions. Word has length 214 [2025-01-09 12:13:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:12,937 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 618 transitions. [2025-01-09 12:13:12,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 618 transitions. [2025-01-09 12:13:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 12:13:12,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:12,939 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:12,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:13:12,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:12,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2075635546, now seen corresponding path program 1 times [2025-01-09 12:13:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943318367] [2025-01-09 12:13:12,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:12,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 12:13:12,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 12:13:12,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:12,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:13,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:13,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943318367] [2025-01-09 12:13:13,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943318367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:13,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:13,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:13:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072189755] [2025-01-09 12:13:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:13,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:13:13,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:13,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:13:13,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:13:13,139 INFO L87 Difference]: Start difference. First operand 416 states and 618 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:13,516 INFO L93 Difference]: Finished difference Result 716 states and 1070 transitions. [2025-01-09 12:13:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:13:13,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 12:13:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:13,519 INFO L225 Difference]: With dead ends: 716 [2025-01-09 12:13:13,520 INFO L226 Difference]: Without dead ends: 510 [2025-01-09 12:13:13,520 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 12:13:13,521 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 294 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:13,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1013 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:13:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-01-09 12:13:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 416. [2025-01-09 12:13:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 279 states have (on average 1.2652329749103943) internal successors, (353), 279 states have internal predecessors, (353), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 12:13:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 617 transitions. [2025-01-09 12:13:13,567 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 617 transitions. Word has length 214 [2025-01-09 12:13:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:13,567 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 617 transitions. [2025-01-09 12:13:13,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 617 transitions. [2025-01-09 12:13:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 12:13:13,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:13,569 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:13,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:13:13,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:13,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash 794583213, now seen corresponding path program 1 times [2025-01-09 12:13:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:13,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865449002] [2025-01-09 12:13:13,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:13,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 12:13:13,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 12:13:13,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:13,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:13,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865449002] [2025-01-09 12:13:13,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865449002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:13,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:13,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:13:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057890415] [2025-01-09 12:13:13,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:13,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:13:13,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:13,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:13:13,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:13:13,922 INFO L87 Difference]: Start difference. First operand 416 states and 617 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:14,057 INFO L93 Difference]: Finished difference Result 904 states and 1347 transitions. [2025-01-09 12:13:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:13:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 12:13:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:14,061 INFO L225 Difference]: With dead ends: 904 [2025-01-09 12:13:14,062 INFO L226 Difference]: Without dead ends: 491 [2025-01-09 12:13:14,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:13:14,064 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 161 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:14,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 696 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:13:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-01-09 12:13:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 416. [2025-01-09 12:13:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 279 states have (on average 1.2473118279569892) internal successors, (348), 279 states have internal predecessors, (348), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 12:13:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 612 transitions. [2025-01-09 12:13:14,147 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 612 transitions. Word has length 214 [2025-01-09 12:13:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:14,147 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 612 transitions. [2025-01-09 12:13:14,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 612 transitions. [2025-01-09 12:13:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 12:13:14,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:14,149 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:14,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:13:14,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2121755626, now seen corresponding path program 1 times [2025-01-09 12:13:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:14,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717543184] [2025-01-09 12:13:14,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 12:13:14,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 12:13:14,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:14,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717543184] [2025-01-09 12:13:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717543184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:14,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:13:14,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575020003] [2025-01-09 12:13:14,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:14,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:13:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:14,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:13:14,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:13:14,368 INFO L87 Difference]: Start difference. First operand 416 states and 612 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:14,970 INFO L93 Difference]: Finished difference Result 1118 states and 1626 transitions. [2025-01-09 12:13:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:13:14,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2025-01-09 12:13:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:14,976 INFO L225 Difference]: With dead ends: 1118 [2025-01-09 12:13:14,976 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 12:13:14,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:13:14,977 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 401 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:14,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 741 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:13:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 12:13:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 731. [2025-01-09 12:13:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 492 states have (on average 1.2357723577235773) internal successors, (608), 492 states have internal predecessors, (608), 231 states have call successors, (231), 7 states have call predecessors, (231), 7 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2025-01-09 12:13:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1070 transitions. [2025-01-09 12:13:15,168 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1070 transitions. Word has length 218 [2025-01-09 12:13:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:15,169 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1070 transitions. [2025-01-09 12:13:15,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1070 transitions. [2025-01-09 12:13:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 12:13:15,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:15,171 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:15,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:13:15,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:15,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:15,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1027689956, now seen corresponding path program 1 times [2025-01-09 12:13:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045978636] [2025-01-09 12:13:15,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:15,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 12:13:15,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 12:13:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:13:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045978636] [2025-01-09 12:13:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045978636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:13:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926615602] [2025-01-09 12:13:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:13:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:13:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:13:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:13:19,947 INFO L87 Difference]: Start difference. First operand 731 states and 1070 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:21,782 INFO L93 Difference]: Finished difference Result 1361 states and 1921 transitions. [2025-01-09 12:13:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:13:21,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2025-01-09 12:13:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:21,788 INFO L225 Difference]: With dead ends: 1361 [2025-01-09 12:13:21,788 INFO L226 Difference]: Without dead ends: 1053 [2025-01-09 12:13:21,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:13:21,789 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 107 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:21,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 817 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:13:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-01-09 12:13:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1005. [2025-01-09 12:13:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 748 states have (on average 1.2339572192513368) internal successors, (923), 754 states have internal predecessors, (923), 243 states have call successors, (243), 13 states have call predecessors, (243), 13 states have return successors, (243), 237 states have call predecessors, (243), 243 states have call successors, (243) [2025-01-09 12:13:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1409 transitions. [2025-01-09 12:13:21,884 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1409 transitions. Word has length 218 [2025-01-09 12:13:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:21,885 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1409 transitions. [2025-01-09 12:13:21,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1409 transitions. [2025-01-09 12:13:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 12:13:21,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:21,887 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:21,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:13:21,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -777748378, now seen corresponding path program 1 times [2025-01-09 12:13:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576391077] [2025-01-09 12:13:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:21,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 12:13:21,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 12:13:21,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:21,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:13:21,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669490463] [2025-01-09 12:13:21,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:21,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:13:21,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:13:21,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:13:21,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:13:22,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 12:13:22,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 12:13:22,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:22,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:13:22,074 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:13:22,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 12:13:22,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 12:13:22,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:22,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:13:22,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:13:22,233 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:13:22,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:13:22,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:13:22,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:13:22,440 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:13:22,569 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:13:22,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:13:22 BoogieIcfgContainer [2025-01-09 12:13:22,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:13:22,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:13:22,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:13:22,574 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:13:22,576 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:09" (3/4) ... [2025-01-09 12:13:22,578 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:13:22,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:13:22,580 INFO L158 Benchmark]: Toolchain (without parser) took 14416.93ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 104.4MB in the beginning and 164.3MB in the end (delta: -59.9MB). Peak memory consumption was 276.6MB. Max. memory is 16.1GB. [2025-01-09 12:13:22,580 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:13:22,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.18ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 88.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:13:22,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.11ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 83.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:13:22,581 INFO L158 Benchmark]: Boogie Preprocessor took 62.31ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 75.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:13:22,581 INFO L158 Benchmark]: RCFGBuilder took 607.43ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 40.3MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 12:13:22,582 INFO L158 Benchmark]: TraceAbstraction took 13412.87ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 39.6MB in the beginning and 164.4MB in the end (delta: -124.8MB). Peak memory consumption was 209.5MB. Max. memory is 16.1GB. [2025-01-09 12:13:22,582 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 478.2MB. Free memory was 164.4MB in the beginning and 164.3MB in the end (delta: 64.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:13:22,583 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.25ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.18ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 88.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.11ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 83.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.31ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 75.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 607.43ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 40.3MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13412.87ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 39.6MB in the beginning and 164.4MB in the end (delta: -124.8MB). Peak memory consumption was 209.5MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 478.2MB. Free memory was 164.4MB in the beginning and 164.3MB in the end (delta: 64.5kB). 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 147, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someUnaryDOUBLEoperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] signed char var_1_27 = 64; [L41] unsigned short int var_1_29 = 8; [L42] unsigned char var_1_30 = 16; [L43] unsigned short int var_1_33 = 48416; [L44] unsigned char var_1_35 = 4; [L45] unsigned char var_1_36 = 25; [L46] unsigned long int var_1_37 = 32; [L47] unsigned char var_1_38 = 8; [L48] double var_1_39 = -0.75; [L49] double var_1_40 = 31.75; [L50] double var_1_41 = 5.5; [L51] double var_1_42 = 32.5; [L52] signed char var_1_43 = 100; [L53] signed char var_1_44 = 50; [L54] signed char var_1_45 = 5; [L55] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0, var_1_9=643/5] [L205] isInitial = 1 [L206] FCALL initially() [L208] CALL updateLastVariables() [L198] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0, var_1_9=643/5] [L208] RET updateLastVariables() [L209] CALL updateVariables() [L144] var_1_9 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L146] var_1_10 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L148] var_1_11 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L151] var_1_12 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L154] var_1_13 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L157] var_1_14 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L160] var_1_18 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L166] var_1_23 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L169] var_1_27 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L172] var_1_30 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_30 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_30 <= 255) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] CALL assume_abort_if_not(var_1_30 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] RET assume_abort_if_not(var_1_30 != 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L179] var_1_36 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L182] var_1_39 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L184] var_1_40 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L186] var_1_41 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L187] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L188] var_1_42 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L190] var_1_44 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_44 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L191] RET assume_abort_if_not(var_1_44 >= -1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L192] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L192] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L193] var_1_45 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L194] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L195] CALL assume_abort_if_not(var_1_45 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L195] RET assume_abort_if_not(var_1_45 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L209] RET updateVariables() [L210] CALL step() [L59] COND FALSE !(\read(var_1_22)) [L64] var_1_24 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L66] COND FALSE !((var_1_20 / var_1_30) < var_1_27) [L69] var_1_29 = ((((((((((((var_1_30) < (var_1_8)) ? (var_1_30) : (var_1_8)))) > (var_1_8)) ? (((((var_1_30) < (var_1_8)) ? (var_1_30) : (var_1_8)))) : (var_1_8)))) > ((var_1_33 - var_1_8))) ? (((((((((var_1_30) < (var_1_8)) ? (var_1_30) : (var_1_8)))) > (var_1_8)) ? (((((var_1_30) < (var_1_8)) ? (var_1_30) : (var_1_8)))) : (var_1_8)))) : ((var_1_33 - var_1_8)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L71] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L74] COND TRUE ((((var_1_8) < (var_1_1)) ? (var_1_8) : (var_1_1))) >= var_1_15 [L75] var_1_37 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L77] COND FALSE !((var_1_39 * (var_1_40 - var_1_41)) >= var_1_42) [L84] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L86] COND FALSE !(((((var_1_39) > (64.75f)) ? (var_1_39) : (64.75f))) <= var_1_40) [L93] var_1_43 = var_1_44 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L95] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L98] var_1_20 = var_1_8 [L99] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L100] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L103] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L104] COND FALSE !(\read(var_1_22)) [L111] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L113] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L114] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L115] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L116] COND FALSE !(\read(var_1_22)) [L123] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L128] signed long int stepLocal_4 = 256; [L129] unsigned char stepLocal_3 = var_1_22; [L130] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L131] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L134] COND FALSE !(stepLocal_3 || var_1_22) [L139] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201-L202] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-641, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=-127, var_1_29=32767, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1680 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1680 mSDsluCounter, 5903 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3505 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1590 IncrementalHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 2398 mSDtfsCounter, 1590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1005occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 523 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2787 NumberOfCodeBlocks, 2787 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2340 ConstructedInterpolants, 0 QuantifiedInterpolants, 11887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 23168/23232 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 12:13:22,646 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_fillercodestructure_filler-ps-co_file-97.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 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:13:24,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:13:24,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:13:24,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:13:24,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:13:24,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:13:24,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:13:24,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:13:24,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:13:24,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:13:24,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:13:24,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:13:24,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:13:24,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:13:24,910 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:13:24,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:13:24,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:13:24,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:13:24,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:13:24,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:13:24,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:13:24,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:13:24,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:13:24,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:13:24,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:13:24,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:13:24,913 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 -> 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 [2025-01-09 12:13:25,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:13:25,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:13:25,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:13:25,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:13:25,197 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:13:25,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2025-01-09 12:13:26,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c649422c/d15dbfabd7604ebcb92a79ae2b01e1d9/FLAG2754faa1e [2025-01-09 12:13:26,776 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:13:26,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2025-01-09 12:13:26,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c649422c/d15dbfabd7604ebcb92a79ae2b01e1d9/FLAG2754faa1e [2025-01-09 12:13:26,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c649422c/d15dbfabd7604ebcb92a79ae2b01e1d9 [2025-01-09 12:13:26,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:13:26,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:13:26,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:13:26,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:13:26,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:13:26,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:26" (1/1) ... [2025-01-09 12:13:26,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b34d74d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:26, skipping insertion in model container [2025-01-09 12:13:26,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:26" (1/1) ... [2025-01-09 12:13:26,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:13:26,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2025-01-09 12:13:27,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:13:27,024 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:13:27,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2025-01-09 12:13:27,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:13:27,084 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:13:27,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27 WrapperNode [2025-01-09 12:13:27,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:13:27,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:13:27,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:13:27,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:13:27,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,137 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2025-01-09 12:13:27,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:13:27,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:13:27,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:13:27,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:13:27,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,169 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 12:13:27,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:13:27,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:13:27,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:13:27,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:13:27,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (1/1) ... [2025-01-09 12:13:27,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:13:27,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:13:27,240 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 12:13:27,251 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 12:13:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:13:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:13:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:13:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:13:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:13:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:13:27,329 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:13:27,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:13:35,839 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 12:13:35,839 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:13:35,855 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:13:35,855 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:13:35,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:35 BoogieIcfgContainer [2025-01-09 12:13:35,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:13:35,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:13:35,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:13:35,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:13:35,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:13:26" (1/3) ... [2025-01-09 12:13:35,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a876cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:35, skipping insertion in model container [2025-01-09 12:13:35,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:27" (2/3) ... [2025-01-09 12:13:35,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a876cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:35, skipping insertion in model container [2025-01-09 12:13:35,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:35" (3/3) ... [2025-01-09 12:13:35,872 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2025-01-09 12:13:35,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:13:35,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:13:35,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:13:35,947 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;@75a06f44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:13:35,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:13:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:13:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:13:35,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:35,962 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:35,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:35,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1681277489, now seen corresponding path program 1 times [2025-01-09 12:13:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:13:35,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596523383] [2025-01-09 12:13:35,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:35,981 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 12:13:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:13:35,983 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 12:13:35,984 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 12:13:36,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:13:36,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:13:36,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:36,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:36,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:13:36,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:13:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2025-01-09 12:13:36,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:13:36,459 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:13:36,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596523383] [2025-01-09 12:13:36,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596523383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:36,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:36,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:13:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731887707] [2025-01-09 12:13:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:36,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:13:36,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:13:36,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:13:36,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:13:36,479 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:13:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:36,499 INFO L93 Difference]: Finished difference Result 182 states and 324 transitions. [2025-01-09 12:13:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:13:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2025-01-09 12:13:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:36,505 INFO L225 Difference]: With dead ends: 182 [2025-01-09 12:13:36,505 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 12:13:36,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:13:36,510 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:36,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:13:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 12:13:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 12:13:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:13:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2025-01-09 12:13:36,548 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 208 [2025-01-09 12:13:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2025-01-09 12:13:36,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:13:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2025-01-09 12:13:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:13:36,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:36,552 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:36,565 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 12:13:36,756 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 12:13:36,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:36,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash 267429533, now seen corresponding path program 1 times [2025-01-09 12:13:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:13:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12028594] [2025-01-09 12:13:36,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:36,760 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 12:13:36,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:13:36,763 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 12:13:36,765 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 12:13:36,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:13:37,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:13:37,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:37,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:13:37,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:13:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:38,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:13:38,516 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:13:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12028594] [2025-01-09 12:13:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12028594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:38,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:38,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:13:38,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731824754] [2025-01-09 12:13:38,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:13:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:13:38,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:13:38,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:13:38,518 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:38,640 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2025-01-09 12:13:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:13:38,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-01-09 12:13:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:38,643 INFO L225 Difference]: With dead ends: 263 [2025-01-09 12:13:38,643 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 12:13:38,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 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 12:13:38,645 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 33 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:38,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 260 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:13:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 12:13:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2025-01-09 12:13:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 12:13:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 254 transitions. [2025-01-09 12:13:38,662 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 254 transitions. Word has length 208 [2025-01-09 12:13:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 254 transitions. [2025-01-09 12:13:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 254 transitions. [2025-01-09 12:13:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:13:38,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:38,665 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:38,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:13:38,869 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 12:13:38,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:38,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1320918369, now seen corresponding path program 1 times [2025-01-09 12:13:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:13:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481258837] [2025-01-09 12:13:38,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:38,874 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 12:13:38,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:13:38,876 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 12:13:38,878 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 12:13:38,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:13:39,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:13:39,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:39,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:39,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:13:39,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:13:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1082 proven. 51 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2025-01-09 12:13:40,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:13:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-01-09 12:13:41,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:13:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481258837] [2025-01-09 12:13:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481258837] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:13:41,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:13:41,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-01-09 12:13:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945372067] [2025-01-09 12:13:41,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:13:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:13:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:13:41,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:13:41,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:13:41,315 INFO L87 Difference]: Start difference. First operand 165 states and 254 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-01-09 12:13:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:42,538 INFO L93 Difference]: Finished difference Result 258 states and 390 transitions. [2025-01-09 12:13:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:13:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 208 [2025-01-09 12:13:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:42,540 INFO L225 Difference]: With dead ends: 258 [2025-01-09 12:13:42,540 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 12:13:42,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:13:42,541 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 114 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:42,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 191 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:13:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 12:13:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-01-09 12:13:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:13:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-01-09 12:13:42,551 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 208 [2025-01-09 12:13:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:42,551 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-01-09 12:13:42,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-01-09 12:13:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-01-09 12:13:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:13:42,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:42,555 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:42,571 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 12:13:42,761 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 12:13:42,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:42,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash -619853791, now seen corresponding path program 1 times [2025-01-09 12:13:42,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:13:42,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300255285] [2025-01-09 12:13:42,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:42,765 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 12:13:42,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:13:42,767 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 12:13:42,768 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 12:13:42,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:13:43,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:13:43,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:43,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:43,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:13:43,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:13:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:44,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:13:44,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:13:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300255285] [2025-01-09 12:13:44,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300255285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:44,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:44,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:13:44,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053860895] [2025-01-09 12:13:44,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:44,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:13:44,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:13:44,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:13:44,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:13:44,064 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:44,803 INFO L93 Difference]: Finished difference Result 254 states and 376 transitions. [2025-01-09 12:13:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:13:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-01-09 12:13:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:44,807 INFO L225 Difference]: With dead ends: 254 [2025-01-09 12:13:44,807 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 12:13:44,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:13:44,808 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 131 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:44,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 473 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:13:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 12:13:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 92. [2025-01-09 12:13:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:13:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2025-01-09 12:13:44,824 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 208 [2025-01-09 12:13:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:44,824 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2025-01-09 12:13:44,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2025-01-09 12:13:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 12:13:44,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:44,826 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:44,839 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 12:13:45,031 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 12:13:45,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:45,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash -907492961, now seen corresponding path program 1 times [2025-01-09 12:13:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:13:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472829384] [2025-01-09 12:13:45,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:45,032 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 12:13:45,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:13:45,034 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 12:13:45,036 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 12:13:45,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 12:13:45,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 12:13:45,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:45,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:45,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:13:45,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:13:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:48,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:13:48,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:13:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472829384] [2025-01-09 12:13:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472829384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:13:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252656207] [2025-01-09 12:13:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:48,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:13:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:13:48,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:13:48,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:13:48,248 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:48,972 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2025-01-09 12:13:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:13:48,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-01-09 12:13:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:48,978 INFO L225 Difference]: With dead ends: 277 [2025-01-09 12:13:48,978 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 12:13:48,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:13:48,979 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 77 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:48,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 402 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:13:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 12:13:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2025-01-09 12:13:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.1759259259259258) internal successors, (127), 108 states have internal predecessors, (127), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 12:13:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 259 transitions. [2025-01-09 12:13:49,038 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 259 transitions. Word has length 209 [2025-01-09 12:13:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:49,038 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 259 transitions. [2025-01-09 12:13:49,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 259 transitions. [2025-01-09 12:13:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 12:13:49,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:49,040 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:49,056 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 12:13:49,240 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 12:13:49,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:49,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 103624289, now seen corresponding path program 1 times [2025-01-09 12:13:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:13:49,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751172336] [2025-01-09 12:13:49,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:49,242 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 12:13:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:13:49,244 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 12:13:49,246 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 12:13:49,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 12:13:49,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 12:13:49,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:49,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:49,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:13:49,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:13:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:13:52,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:13:52,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:13:52,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751172336] [2025-01-09 12:13:52,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751172336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:13:52,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:13:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:13:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344612380] [2025-01-09 12:13:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:13:52,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:13:52,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:13:52,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:13:52,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:13:52,673 INFO L87 Difference]: Start difference. First operand 179 states and 259 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:53,413 INFO L93 Difference]: Finished difference Result 364 states and 524 transitions. [2025-01-09 12:13:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:13:53,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-01-09 12:13:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:53,415 INFO L225 Difference]: With dead ends: 364 [2025-01-09 12:13:53,415 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 12:13:53,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:13:53,416 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 79 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:53,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 413 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:13:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 12:13:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 179. [2025-01-09 12:13:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.1759259259259258) internal successors, (127), 108 states have internal predecessors, (127), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 12:13:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 259 transitions. [2025-01-09 12:13:53,445 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 259 transitions. Word has length 209 [2025-01-09 12:13:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:53,447 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 259 transitions. [2025-01-09 12:13:53,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:13:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 259 transitions. [2025-01-09 12:13:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 12:13:53,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:53,449 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:53,462 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 (7)] Ended with exit code 0 [2025-01-09 12:13:53,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 12:13:53,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1987838208, now seen corresponding path program 1 times [2025-01-09 12:13:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:13:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000748739] [2025-01-09 12:13:53,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:53,652 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 12:13:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:13:53,654 INFO L229 MonitoredProcess]: Starting monitored process 8 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 12:13:53,656 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 (8)] Waiting until timeout for monitored process [2025-01-09 12:13:53,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 12:13:53,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 12:13:53,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:53,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:13:54,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 12:13:54,006 INFO L279 TraceCheckSpWp]: Computing forward predicates...