./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.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_variablewrapping_wrapper-s_file-81.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 2b07b7903cb9834718dcbd3dbb565f62432b2101fe170e5e45b3142d9f35cf0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:03:36,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:03:36,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:03:36,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:03:36,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:03:36,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:03:36,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:03:36,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:03:36,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:03:36,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:03:36,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:03:36,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:03:36,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:03:36,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:03:36,113 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:03:36,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:03:36,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:03:36,114 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:03:36,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:03:36,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:03:36,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:03:36,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:03:36,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:03:36,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:36,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:36,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:03:36,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:36,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:36,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:36,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:36,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:03:36,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:03:36,116 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:03:36,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:03:36,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:03:36,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:03:36,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:03:36,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:03:36,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:03:36,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:03:36,117 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 -> 2b07b7903cb9834718dcbd3dbb565f62432b2101fe170e5e45b3142d9f35cf0c [2025-01-09 16:03:36,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:03:36,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:03:36,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:03:36,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:03:36,396 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:03:36,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.i [2025-01-09 16:03:37,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc569f131/978c07768a474dfc83b09212fa0dc503/FLAGeac5846c6 [2025-01-09 16:03:37,766 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:03:37,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.i [2025-01-09 16:03:37,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc569f131/978c07768a474dfc83b09212fa0dc503/FLAGeac5846c6 [2025-01-09 16:03:38,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc569f131/978c07768a474dfc83b09212fa0dc503 [2025-01-09 16:03:38,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:03:38,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:03:38,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:38,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:03:38,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:03:38,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bdde71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38, skipping insertion in model container [2025-01-09 16:03:38,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:03:38,199 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_variablewrapping_wrapper-s_file-81.i[916,929] [2025-01-09 16:03:38,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:38,261 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:03:38,268 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_variablewrapping_wrapper-s_file-81.i[916,929] [2025-01-09 16:03:38,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:38,303 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:03:38,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38 WrapperNode [2025-01-09 16:03:38,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:38,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:38,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:03:38,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:03:38,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,353 INFO L138 Inliner]: procedures = 30, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2025-01-09 16:03:38,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:38,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:03:38,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:03:38,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:03:38,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,381 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:03:38,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:03:38,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:03:38,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:03:38,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:03:38,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (1/1) ... [2025-01-09 16:03:38,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:38,459 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 16:03:38,461 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 16:03:38,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:03:38,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:03:38,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:03:38,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:03:38,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:03:38,557 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:03:38,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:03:39,095 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-01-09 16:03:39,096 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:03:39,110 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:03:39,111 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:03:39,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:39 BoogieIcfgContainer [2025-01-09 16:03:39,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:03:39,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:03:39,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:03:39,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:03:39,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:38" (1/3) ... [2025-01-09 16:03:39,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472ffad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:39, skipping insertion in model container [2025-01-09 16:03:39,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:38" (2/3) ... [2025-01-09 16:03:39,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472ffad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:39, skipping insertion in model container [2025-01-09 16:03:39,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:39" (3/3) ... [2025-01-09 16:03:39,122 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-81.i [2025-01-09 16:03:39,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:03:39,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-81.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:03:39,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:03:39,204 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;@31557ab5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:03:39,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:03:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 107 states have (on average 1.439252336448598) internal successors, (154), 108 states have internal predecessors, (154), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:03:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:03:39,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:39,222 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:03:39,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:39,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1752184373, now seen corresponding path program 1 times [2025-01-09 16:03:39,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:39,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355720559] [2025-01-09 16:03:39,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:39,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:03:39,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:03:39,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:39,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 16:03:39,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355720559] [2025-01-09 16:03:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355720559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712265226] [2025-01-09 16:03:39,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:39,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:39,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:39,567 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 16:03:39,569 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 16:03:39,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:03:39,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:03:39,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:39,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:39,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:03:39,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 16:03:39,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:39,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712265226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:39,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:39,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:03:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262353541] [2025-01-09 16:03:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:03:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:39,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:03:39,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:39,813 INFO L87 Difference]: Start difference. First operand has 128 states, 107 states have (on average 1.439252336448598) internal successors, (154), 108 states have internal predecessors, (154), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:03:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:39,839 INFO L93 Difference]: Finished difference Result 250 states and 393 transitions. [2025-01-09 16:03:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:03:39,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-01-09 16:03:39,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:39,846 INFO L225 Difference]: With dead ends: 250 [2025-01-09 16:03:39,846 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 16:03:39,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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 16:03:39,851 INFO L435 NwaCegarLoop]: 183 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, 183 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 16:03:39,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 16:03:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-01-09 16:03:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:03:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2025-01-09 16:03:39,883 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 148 [2025-01-09 16:03:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:39,883 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2025-01-09 16:03:39,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:03:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2025-01-09 16:03:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:03:39,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:39,886 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:03:39,893 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 16:03:40,087 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 16:03:40,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:40,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash -880279321, now seen corresponding path program 1 times [2025-01-09 16:03:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:40,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43308203] [2025-01-09 16:03:40,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:40,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:40,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:03:40,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:03:40,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:40,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:03:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:40,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43308203] [2025-01-09 16:03:40,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43308203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:40,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:40,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218654963] [2025-01-09 16:03:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:40,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:40,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:40,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:40,647 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:03:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:40,941 INFO L93 Difference]: Finished difference Result 370 states and 544 transitions. [2025-01-09 16:03:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:40,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-01-09 16:03:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:40,943 INFO L225 Difference]: With dead ends: 370 [2025-01-09 16:03:40,943 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 16:03:40,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 16:03:40,944 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 174 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:40,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 387 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:03:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 16:03:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 219. [2025-01-09 16:03:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.3833333333333333) internal successors, (249), 180 states have internal predecessors, (249), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:03:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 321 transitions. [2025-01-09 16:03:40,977 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 321 transitions. Word has length 148 [2025-01-09 16:03:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:40,978 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 321 transitions. [2025-01-09 16:03:40,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:03:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 321 transitions. [2025-01-09 16:03:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:03:40,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:40,981 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:03:40,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:03:40,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:40,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash 376301325, now seen corresponding path program 1 times [2025-01-09 16:03:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:40,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263508785] [2025-01-09 16:03:40,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:40,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:41,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:03:41,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:03:41,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:41,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 16:03:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263508785] [2025-01-09 16:03:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263508785] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838270275] [2025-01-09 16:03:41,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:41,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:41,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:41,214 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 16:03:41,216 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 16:03:41,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:03:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:03:41,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:41,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:41,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:03:41,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:03:41,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838270275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 16:03:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428920346] [2025-01-09 16:03:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:41,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:41,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:41,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:03:41,490 INFO L87 Difference]: Start difference. First operand 219 states and 321 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:03:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:41,518 INFO L93 Difference]: Finished difference Result 345 states and 507 transitions. [2025-01-09 16:03:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:41,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-01-09 16:03:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:41,520 INFO L225 Difference]: With dead ends: 345 [2025-01-09 16:03:41,520 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 16:03:41,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:03:41,522 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:41,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 16:03:41,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-01-09 16:03:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 184 states have (on average 1.375) internal successors, (253), 184 states have internal predecessors, (253), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:03:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 325 transitions. [2025-01-09 16:03:41,540 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 325 transitions. Word has length 149 [2025-01-09 16:03:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:41,541 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 325 transitions. [2025-01-09 16:03:41,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:03:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 325 transitions. [2025-01-09 16:03:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:03:41,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:41,544 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:03:41,554 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 16:03:41,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:41,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:41,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1168501528, now seen corresponding path program 1 times [2025-01-09 16:03:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401102234] [2025-01-09 16:03:41,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:41,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:03:41,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:03:41,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:41,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:03:42,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401102234] [2025-01-09 16:03:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401102234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:42,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:42,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339385801] [2025-01-09 16:03:42,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:42,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:42,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:42,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:42,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:42,162 INFO L87 Difference]: Start difference. First operand 223 states and 325 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:03:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:42,380 INFO L93 Difference]: Finished difference Result 405 states and 589 transitions. [2025-01-09 16:03:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:42,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-01-09 16:03:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:42,382 INFO L225 Difference]: With dead ends: 405 [2025-01-09 16:03:42,382 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 16:03:42,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 16:03:42,383 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 166 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:42,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 403 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 16:03:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 223. [2025-01-09 16:03:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 184 states have (on average 1.3641304347826086) internal successors, (251), 184 states have internal predecessors, (251), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:03:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 323 transitions. [2025-01-09 16:03:42,396 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 323 transitions. Word has length 151 [2025-01-09 16:03:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:42,396 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 323 transitions. [2025-01-09 16:03:42,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:03:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 323 transitions. [2025-01-09 16:03:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:03:42,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:42,397 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:03:42,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:03:42,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:42,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:42,398 INFO L85 PathProgramCache]: Analyzing trace with hash 579604517, now seen corresponding path program 1 times [2025-01-09 16:03:42,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:42,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601785786] [2025-01-09 16:03:42,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:42,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:42,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:03:42,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:03:42,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:42,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:03:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601785786] [2025-01-09 16:03:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601785786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:42,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:42,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:42,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967173982] [2025-01-09 16:03:42,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:42,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:42,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:42,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:42,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:42,671 INFO L87 Difference]: Start difference. First operand 223 states and 323 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:03:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:42,993 INFO L93 Difference]: Finished difference Result 398 states and 573 transitions. [2025-01-09 16:03:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:42,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2025-01-09 16:03:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:42,999 INFO L225 Difference]: With dead ends: 398 [2025-01-09 16:03:42,999 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 16:03:42,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:43,000 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 49 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:43,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 604 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:03:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 16:03:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 227. [2025-01-09 16:03:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:03:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 327 transitions. [2025-01-09 16:03:43,024 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 327 transitions. Word has length 153 [2025-01-09 16:03:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:43,024 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 327 transitions. [2025-01-09 16:03:43,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:03:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 327 transitions. [2025-01-09 16:03:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 16:03:43,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:43,026 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:03:43,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:03:43,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:43,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1910376064, now seen corresponding path program 1 times [2025-01-09 16:03:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327429231] [2025-01-09 16:03:43,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:43,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:43,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 16:03:43,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 16:03:43,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:43,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:03:43,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:03:43,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 16:03:43,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 16:03:43,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:43,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:03:43,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:03:43,274 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:03:43,274 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:03:43,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:03:43,278 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 16:03:43,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:03:43,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:03:43 BoogieIcfgContainer [2025-01-09 16:03:43,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:03:43,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:03:43,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:03:43,325 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:03:43,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:39" (3/4) ... [2025-01-09 16:03:43,327 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:03:43,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:03:43,328 INFO L158 Benchmark]: Toolchain (without parser) took 5233.98ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.8MB in the beginning and 219.1MB in the end (delta: -95.3MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2025-01-09 16:03:43,328 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:43,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.22ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 105.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:03:43,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.99ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 101.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:43,329 INFO L158 Benchmark]: Boogie Preprocessor took 65.43ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 98.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:03:43,329 INFO L158 Benchmark]: RCFGBuilder took 692.35ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 61.9MB in the end (delta: 36.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:03:43,329 INFO L158 Benchmark]: TraceAbstraction took 4209.93ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 61.9MB in the beginning and 219.2MB in the end (delta: -157.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2025-01-09 16:03:43,329 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 335.5MB. Free memory was 219.2MB in the beginning and 219.1MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:43,330 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.17ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.22ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 105.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.99ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 101.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.43ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 98.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 692.35ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 61.9MB in the end (delta: 36.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4209.93ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 61.9MB in the beginning and 219.2MB in the end (delta: -157.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 335.5MB. Free memory was 219.2MB in the beginning and 219.1MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L57] unsigned short int last_1_WrapperStruct00_var_1_13 = 5; [L58] signed long int last_1_WrapperStruct00_var_1_18 = -8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L130] isInitial = 1 [L131] FCALL initially() [L133] CALL updateLastVariables() [L122] EXPR WrapperStruct00.var_1_13 [L122] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L123] EXPR WrapperStruct00.var_1_18 [L123] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L91] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L94] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_3 [L95] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_3 [L95] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_4 [L97] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_4 [L97] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_5 [L99] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_5 [L99] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] EXPR (WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L100] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_6 [L101] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_6 [L101] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L111] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L117] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L134] RET updateVariables() [L135] CALL step() [L62] signed long int stepLocal_0 = (((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18)); VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25] [L63] EXPR last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25] [L63] COND TRUE stepLocal_0 != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13) [L64] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L64] COND TRUE WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_11 [L65] EXPR WrapperStruct00.var_1_12 [L65] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) [L70] EXPR WrapperStruct00.var_1_11 [L70] EXPR WrapperStruct00.var_1_7 [L70] unsigned char stepLocal_1 = WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7; [L71] stepLocal_1 && WrapperStruct00.var_1_14 [L71] EXPR WrapperStruct00.var_1_14 [L71] stepLocal_1 && WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L71] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_14) [L74] EXPR WrapperStruct00.var_1_16 [L74] EXPR WrapperStruct00.var_1_17 [L74] WrapperStruct00.var_1_13 = ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17) [L76] EXPR WrapperStruct00.var_1_7 [L76] signed char stepLocal_2 = WrapperStruct00.var_1_7; [L77] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_2=-64] [L77] COND FALSE !(stepLocal_2 > WrapperStruct00.var_1_16) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_15 [L86] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L86] COND TRUE WrapperStruct00.var_1_2 [L87] EXPR WrapperStruct00.var_1_3 [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_5 [L87] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L87] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) [L87] EXPR WrapperStruct00.var_1_3 [L87] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L87] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1 [L126] EXPR WrapperStruct00.var_1_1 [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR WrapperStruct00.var_1_4 [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_16) ? ((WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_18 == ((signed long int) ((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126-L127] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_16) ? ((WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_18 == ((signed long int) ((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_15))) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 2109 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1298 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 529 IncrementalHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 811 mSDtfsCounter, 529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 98 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1201 NumberOfCodeBlocks, 1201 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 1436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1043 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 4199/4284 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 16:03:43,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.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 2b07b7903cb9834718dcbd3dbb565f62432b2101fe170e5e45b3142d9f35cf0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:03:45,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:03:45,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:03:45,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:03:45,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:03:45,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:03:45,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:03:45,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:03:45,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:03:45,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:03:45,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:03:45,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:03:45,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:03:45,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:03:45,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:03:45,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:45,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:45,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:45,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:03:45,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:03:45,658 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 -> 2b07b7903cb9834718dcbd3dbb565f62432b2101fe170e5e45b3142d9f35cf0c [2025-01-09 16:03:45,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:03:45,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:03:45,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:03:45,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:03:45,926 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:03:45,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.i [2025-01-09 16:03:47,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62b231898/b739cb2c7f034e5aae632a478444d2dd/FLAGf69c7d3d5 [2025-01-09 16:03:47,394 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:03:47,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.i [2025-01-09 16:03:47,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62b231898/b739cb2c7f034e5aae632a478444d2dd/FLAGf69c7d3d5 [2025-01-09 16:03:47,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62b231898/b739cb2c7f034e5aae632a478444d2dd [2025-01-09 16:03:47,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:03:47,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:03:47,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:47,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:03:47,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:03:47,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:47,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7690227e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47, skipping insertion in model container [2025-01-09 16:03:47,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:47,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:03:47,843 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_variablewrapping_wrapper-s_file-81.i[916,929] [2025-01-09 16:03:47,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:47,902 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:03:47,911 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_variablewrapping_wrapper-s_file-81.i[916,929] [2025-01-09 16:03:47,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:47,991 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:03:47,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47 WrapperNode [2025-01-09 16:03:47,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:47,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:47,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:03:47,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:03:48,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,060 INFO L138 Inliner]: procedures = 37, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 520 [2025-01-09 16:03:48,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:48,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:03:48,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:03:48,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:03:48,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,108 INFO L175 MemorySlicer]: Split 143 memory accesses to 2 slices as follows [2, 141]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-01-09 16:03:48,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:03:48,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:03:48,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:03:48,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:03:48,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (1/1) ... [2025-01-09 16:03:48,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:48,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:48,206 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 16:03:48,213 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 16:03:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:03:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:03:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:03:48,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:03:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:03:48,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:03:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:03:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:03:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:03:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:03:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:03:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:03:48,376 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:03:48,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:04:01,280 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-01-09 16:04:01,281 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:04:01,294 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:04:01,296 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:04:01,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:01 BoogieIcfgContainer [2025-01-09 16:04:01,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:04:01,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:04:01,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:04:01,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:04:01,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:47" (1/3) ... [2025-01-09 16:04:01,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45def9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:04:01, skipping insertion in model container [2025-01-09 16:04:01,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:47" (2/3) ... [2025-01-09 16:04:01,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45def9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:04:01, skipping insertion in model container [2025-01-09 16:04:01,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:01" (3/3) ... [2025-01-09 16:04:01,304 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-81.i [2025-01-09 16:04:01,315 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:04:01,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-81.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:04:01,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:04:01,369 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;@541858b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:04:01,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:04:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:04:01,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:01,388 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:01,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash 805269176, now seen corresponding path program 1 times [2025-01-09 16:04:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818924353] [2025-01-09 16:04:01,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:01,405 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 16:04:01,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:01,416 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 16:04:01,428 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 16:04:01,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:04:01,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:04:01,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:01,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:01,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:04:01,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-09 16:04:01,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:01,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:01,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818924353] [2025-01-09 16:04:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818924353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:01,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:04:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212559247] [2025-01-09 16:04:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:01,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:04:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:01,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:04:01,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:04:01,765 INFO L87 Difference]: Start difference. First operand has 120 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:04:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:01,785 INFO L93 Difference]: Finished difference Result 234 states and 365 transitions. [2025-01-09 16:04:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:04:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-01-09 16:04:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:01,811 INFO L225 Difference]: With dead ends: 234 [2025-01-09 16:04:01,811 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 16:04:01,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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 16:04:01,815 INFO L435 NwaCegarLoop]: 169 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, 169 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 16:04:01,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:04:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 16:04:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 16:04:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-01-09 16:04:01,862 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 147 [2025-01-09 16:04:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-01-09 16:04:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:04:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-01-09 16:04:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:04:01,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:01,869 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:01,885 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 16:04:02,069 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 16:04:02,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:02,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash -690625508, now seen corresponding path program 1 times [2025-01-09 16:04:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:02,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792079858] [2025-01-09 16:04:02,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:02,072 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 16:04:02,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:02,074 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 16:04:02,076 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 16:04:02,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:04:02,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:04:02,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:02,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:02,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:04:02,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 16:04:02,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:02,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:02,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792079858] [2025-01-09 16:04:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792079858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:04:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399838444] [2025-01-09 16:04:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:02,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:04:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:02,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:04:02,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:04:02,365 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:04:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:02,460 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2025-01-09 16:04:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:04:02,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-01-09 16:04:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:02,462 INFO L225 Difference]: With dead ends: 233 [2025-01-09 16:04:02,464 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 16:04:02,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:04:02,466 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:02,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:04:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 16:04:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 16:04:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-01-09 16:04:02,481 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 147 [2025-01-09 16:04:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:02,481 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-01-09 16:04:02,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:04:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-01-09 16:04:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:04:02,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:02,483 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:02,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:04:02,683 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 16:04:02,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1178672614, now seen corresponding path program 1 times [2025-01-09 16:04:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628934187] [2025-01-09 16:04:02,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:02,685 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 16:04:02,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:02,687 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 16:04:02,688 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 16:04:02,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:04:02,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:04:02,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:02,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:02,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:04:02,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:04:02,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:02,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628934187] [2025-01-09 16:04:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628934187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:04:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376273297] [2025-01-09 16:04:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:02,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:04:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:02,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:04:02,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:04:02,937 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:02,970 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2025-01-09 16:04:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:04:02,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 16:04:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:02,972 INFO L225 Difference]: With dead ends: 237 [2025-01-09 16:04:02,972 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 16:04:02,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:04:02,973 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:02,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:04:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 16:04:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-01-09 16:04:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2025-01-09 16:04:02,981 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 147 [2025-01-09 16:04:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:02,981 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2025-01-09 16:04:02,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2025-01-09 16:04:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:04:02,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:02,982 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:02,990 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 16:04:03,183 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 16:04:03,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:03,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -379003051, now seen corresponding path program 1 times [2025-01-09 16:04:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707331834] [2025-01-09 16:04:03,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:03,188 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 16:04:03,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:03,193 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 16:04:03,198 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 16:04:03,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:04:03,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:04:03,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:03,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:03,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:04:03,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:04:03,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:03,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707331834] [2025-01-09 16:04:03,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707331834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:03,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:03,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:04:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287950128] [2025-01-09 16:04:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:03,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:04:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:03,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:04:03,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:04:03,592 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:05,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:07,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:11,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:17,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:21,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:22,115 INFO L93 Difference]: Finished difference Result 272 states and 387 transitions. [2025-01-09 16:04:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:04:22,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-01-09 16:04:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:22,119 INFO L225 Difference]: With dead ends: 272 [2025-01-09 16:04:22,119 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 16:04:22,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:22,120 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 42 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:22,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 477 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 18.5s Time] [2025-01-09 16:04:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 16:04:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2025-01-09 16:04:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2025-01-09 16:04:22,144 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 149 [2025-01-09 16:04:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:22,145 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2025-01-09 16:04:22,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2025-01-09 16:04:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:04:22,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:22,150 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:22,165 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 16:04:22,350 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 16:04:22,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:22,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash 820243121, now seen corresponding path program 1 times [2025-01-09 16:04:22,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:22,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069080361] [2025-01-09 16:04:22,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:22,352 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 16:04:22,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:22,355 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 16:04:22,356 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 16:04:22,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:04:22,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:04:22,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:22,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:22,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:04:22,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:04:22,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:22,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:22,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069080361] [2025-01-09 16:04:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069080361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:22,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:22,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:04:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155674216] [2025-01-09 16:04:22,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:22,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:04:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:22,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:04:22,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:04:22,658 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:29,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:30,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:35,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:37,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:37,813 INFO L93 Difference]: Finished difference Result 274 states and 388 transitions. [2025-01-09 16:04:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:04:37,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-01-09 16:04:37,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:37,815 INFO L225 Difference]: With dead ends: 274 [2025-01-09 16:04:37,815 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 16:04:37,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:37,817 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 37 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:37,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 479 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 15.1s Time] [2025-01-09 16:04:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 16:04:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2025-01-09 16:04:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2025-01-09 16:04:37,830 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 151 [2025-01-09 16:04:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:37,830 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2025-01-09 16:04:37,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2025-01-09 16:04:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:04:37,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:37,831 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:37,840 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 16:04:38,035 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 16:04:38,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:38,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1521307699, now seen corresponding path program 1 times [2025-01-09 16:04:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:38,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622326223] [2025-01-09 16:04:38,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:38,036 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 16:04:38,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:38,040 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 16:04:38,041 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 16:04:38,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:04:38,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:04:38,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:38,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:38,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:04:38,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:04:38,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:38,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622326223] [2025-01-09 16:04:38,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622326223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:38,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:38,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:04:38,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154890095] [2025-01-09 16:04:38,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:38,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:38,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:38,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:38,353 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:38,460 INFO L93 Difference]: Finished difference Result 255 states and 362 transitions. [2025-01-09 16:04:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:04:38,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-01-09 16:04:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:38,462 INFO L225 Difference]: With dead ends: 255 [2025-01-09 16:04:38,462 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 16:04:38,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:38,462 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:38,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 804 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:04:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 16:04:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-01-09 16:04:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 184 transitions. [2025-01-09 16:04:38,469 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 184 transitions. Word has length 151 [2025-01-09 16:04:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:38,470 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 184 transitions. [2025-01-09 16:04:38,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 184 transitions. [2025-01-09 16:04:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:04:38,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:38,472 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:38,481 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 16:04:38,672 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 16:04:38,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:38,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1220673000, now seen corresponding path program 1 times [2025-01-09 16:04:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:38,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668822525] [2025-01-09 16:04:38,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:38,675 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 16:04:38,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:38,678 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 16:04:38,679 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 16:04:38,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:04:38,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:04:38,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:38,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:38,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:04:38,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:04:39,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:39,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668822525] [2025-01-09 16:04:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668822525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:39,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:04:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685131473] [2025-01-09 16:04:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:39,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:04:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:39,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:04:39,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:04:39,456 INFO L87 Difference]: Start difference. First operand 131 states and 184 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:40,431 INFO L93 Difference]: Finished difference Result 310 states and 435 transitions. [2025-01-09 16:04:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:04:40,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-01-09 16:04:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:40,433 INFO L225 Difference]: With dead ends: 310 [2025-01-09 16:04:40,433 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 16:04:40,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:04:40,434 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:40,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 482 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:04:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 16:04:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 159. [2025-01-09 16:04:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 states have internal predecessors, (186), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 222 transitions. [2025-01-09 16:04:40,439 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 222 transitions. Word has length 151 [2025-01-09 16:04:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:40,440 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 222 transitions. [2025-01-09 16:04:40,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:04:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 222 transitions. [2025-01-09 16:04:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:04:40,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:40,441 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:40,450 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 (8)] Ended with exit code 0 [2025-01-09 16:04:40,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 16:04:40,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:40,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash 282339408, now seen corresponding path program 1 times [2025-01-09 16:04:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:40,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765997277] [2025-01-09 16:04:40,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:40,646 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 16:04:40,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:40,648 INFO L229 MonitoredProcess]: Starting monitored process 9 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 16:04:40,650 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 (9)] Waiting until timeout for monitored process [2025-01-09 16:04:40,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:04:41,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:04:41,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:41,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:41,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:04:41,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:41,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:41,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 16:04:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 16:04:41,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:41,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765997277] [2025-01-09 16:04:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765997277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:41,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:41,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:04:41,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920118297] [2025-01-09 16:04:41,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:41,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:41,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:41,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:41,409 INFO L87 Difference]: Start difference. First operand 159 states and 222 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:04:47,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:52,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:54,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:56,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:57,097 INFO L93 Difference]: Finished difference Result 315 states and 441 transitions. [2025-01-09 16:04:57,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:57,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-01-09 16:04:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:57,099 INFO L225 Difference]: With dead ends: 315 [2025-01-09 16:04:57,099 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 16:04:57,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:57,100 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 150 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:57,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 474 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 2 Unknown, 0 Unchecked, 15.6s Time] [2025-01-09 16:04:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 16:04:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-01-09 16:04:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 137 states have internal predecessors, (183), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:04:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 219 transitions. [2025-01-09 16:04:57,109 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 219 transitions. Word has length 151 [2025-01-09 16:04:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:57,109 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 219 transitions. [2025-01-09 16:04:57,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:04:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 219 transitions. [2025-01-09 16:04:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:04:57,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:57,111 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:57,128 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 (9)] Ended with exit code 0 [2025-01-09 16:04:57,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 16:04:57,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:57,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2025434680, now seen corresponding path program 1 times [2025-01-09 16:04:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430280187] [2025-01-09 16:04:57,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:57,313 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 16:04:57,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:57,315 INFO L229 MonitoredProcess]: Starting monitored process 10 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 16:04:57,316 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 (10)] Waiting until timeout for monitored process [2025-01-09 16:04:57,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:04:57,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:04:57,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:57,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:57,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:04:57,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:58,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:58,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2025-01-09 16:04:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 12 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 16:04:58,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:04:58,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:58,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2025-01-09 16:04:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 16:04:58,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430280187] [2025-01-09 16:04:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430280187] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:04:58,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:04:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-01-09 16:04:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363586326] [2025-01-09 16:04:58,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:04:58,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:04:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:58,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:04:58,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:04:58,845 INFO L87 Difference]: Start difference. First operand 157 states and 219 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2025-01-09 16:05:00,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:05:03,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:05:07,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:05:10,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:05:16,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:05:17,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:05:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:18,086 INFO L93 Difference]: Finished difference Result 324 states and 450 transitions. [2025-01-09 16:05:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:05:18,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) Word has length 153 [2025-01-09 16:05:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:18,088 INFO L225 Difference]: With dead ends: 324 [2025-01-09 16:05:18,088 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 16:05:18,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:05:18,089 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:18,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 726 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 18.8s Time] [2025-01-09 16:05:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 16:05:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-01-09 16:05:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 137 states have internal predecessors, (181), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:05:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 217 transitions. [2025-01-09 16:05:18,094 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 217 transitions. Word has length 153 [2025-01-09 16:05:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:18,094 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 217 transitions. [2025-01-09 16:05:18,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2025-01-09 16:05:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 217 transitions. [2025-01-09 16:05:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:05:18,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:18,095 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:05:18,113 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 (10)] Ended with exit code 0 [2025-01-09 16:05:18,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 16:05:18,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:18,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1835027018, now seen corresponding path program 1 times [2025-01-09 16:05:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:05:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095489494] [2025-01-09 16:05:18,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:18,297 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 16:05:18,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:05:18,300 INFO L229 MonitoredProcess]: Starting monitored process 11 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 16:05:18,301 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 (11)] Waiting until timeout for monitored process [2025-01-09 16:05:18,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:05:18,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:05:18,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:18,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:18,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:05:18,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:19,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:19,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2025-01-09 16:05:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-01-09 16:05:19,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:19,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:05:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095489494] [2025-01-09 16:05:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095489494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:19,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:19,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:05:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772251562] [2025-01-09 16:05:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:19,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:05:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:05:19,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:05:19,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:19,117 INFO L87 Difference]: Start difference. First operand 157 states and 217 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)