./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:51:09,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:51:09,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:51:09,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:51:09,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:51:09,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:51:09,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:51:09,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:51:09,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:51:09,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:51:09,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:51:09,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:51:09,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:51:09,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:51:09,557 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:51:09,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:51:09,558 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:51:09,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:51:09,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:51:09,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:51:09,560 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/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 -> 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af [2025-03-04 01:51:09,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:51:09,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:51:09,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:51:09,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:51:09,792 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:51:09,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2025-03-04 01:51:10,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21be5f16f/89c3f1013d8e494180c7e98c2aa4e354/FLAGbb3c9d9f0 [2025-03-04 01:51:11,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:51:11,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2025-03-04 01:51:11,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21be5f16f/89c3f1013d8e494180c7e98c2aa4e354/FLAGbb3c9d9f0 [2025-03-04 01:51:11,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21be5f16f/89c3f1013d8e494180c7e98c2aa4e354 [2025-03-04 01:51:11,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:51:11,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:51:11,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:51:11,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:51:11,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:51:11,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0fd008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11, skipping insertion in model container [2025-03-04 01:51:11,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:51:11,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2025-03-04 01:51:11,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:51:11,405 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:51:11,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2025-03-04 01:51:11,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:51:11,453 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:51:11,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11 WrapperNode [2025-03-04 01:51:11,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:51:11,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:51:11,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:51:11,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:51:11,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,502 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2025-03-04 01:51:11,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:51:11,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:51:11,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:51:11,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:51:11,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,544 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2025-03-04 01:51:11,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:51:11,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:51:11,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:51:11,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:51:11,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (1/1) ... [2025-03-04 01:51:11,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:51:11,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:51:11,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:51:11,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:51:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:51:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:51:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:51:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:51:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:51:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:51:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:51:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:51:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:51:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:51:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:51:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:51:11,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:51:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:51:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:51:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:51:11,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:51:11,706 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:51:11,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:51:12,034 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite85#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~ite123#1;havoc property_#t~mem102#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:51:12,068 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-03-04 01:51:12,068 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:51:12,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:51:12,078 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:51:12,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:12 BoogieIcfgContainer [2025-03-04 01:51:12,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:51:12,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:51:12,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:51:12,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:51:12,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:51:11" (1/3) ... [2025-03-04 01:51:12,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f340a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:51:12, skipping insertion in model container [2025-03-04 01:51:12,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:11" (2/3) ... [2025-03-04 01:51:12,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f340a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:51:12, skipping insertion in model container [2025-03-04 01:51:12,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:12" (3/3) ... [2025-03-04 01:51:12,085 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2025-03-04 01:51:12,095 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:51:12,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:51:12,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:51:12,138 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;@313e7fe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:51:12,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:51:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:12,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:12,150 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:12,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:12,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -361994844, now seen corresponding path program 1 times [2025-03-04 01:51:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835595153] [2025-03-04 01:51:12,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:12,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:12,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:12,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:12,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:51:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835595153] [2025-03-04 01:51:12,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835595153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236438758] [2025-03-04 01:51:12,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:12,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:51:12,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:51:12,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:51:12,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:51:12,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:12,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:12,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:12,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:12,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:51:12,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:51:12,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236438758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:12,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:51:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:51:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363871931] [2025-03-04 01:51:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:12,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:51:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:12,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:51:12,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:51:12,645 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:51:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:12,662 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-03-04 01:51:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:51:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-04 01:51:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:12,668 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:51:12,669 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:51:12,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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-03-04 01:51:12,673 INFO L435 NwaCegarLoop]: 134 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, 134 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-03-04 01:51:12,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:51:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 01:51:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-03-04 01:51:12,704 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-03-04 01:51:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:12,705 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-03-04 01:51:12,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:51:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-03-04 01:51:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:12,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:12,708 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:12,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:51:12,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:51:12,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:12,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash -692953925, now seen corresponding path program 1 times [2025-03-04 01:51:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:12,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131694280] [2025-03-04 01:51:12,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:12,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:12,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:12,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:51:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131694280] [2025-03-04 01:51:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131694280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:13,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:51:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504116684] [2025-03-04 01:51:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:13,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:51:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:13,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:51:13,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:51:13,143 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:13,179 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2025-03-04 01:51:13,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:51:13,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:51:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:13,180 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:51:13,181 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:51:13,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:51:13,182 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:13,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:51:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-04 01:51:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-03-04 01:51:13,188 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 84 [2025-03-04 01:51:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:13,189 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-03-04 01:51:13,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-03-04 01:51:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:13,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:13,191 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:13,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:51:13,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:13,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:13,191 INFO L85 PathProgramCache]: Analyzing trace with hash -692030404, now seen corresponding path program 1 times [2025-03-04 01:51:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:13,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275591840] [2025-03-04 01:51:13,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:13,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:13,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:13,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:51:13,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275591840] [2025-03-04 01:51:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275591840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:51:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848430661] [2025-03-04 01:51:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:13,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:51:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:13,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:51:13,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:13,567 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:13,755 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2025-03-04 01:51:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:51:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:51:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:13,757 INFO L225 Difference]: With dead ends: 227 [2025-03-04 01:51:13,757 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 01:51:13,758 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-03-04 01:51:13,758 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:13,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 367 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:51:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 01:51:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 97. [2025-03-04 01:51:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2025-03-04 01:51:13,765 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 84 [2025-03-04 01:51:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:13,766 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2025-03-04 01:51:13,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2025-03-04 01:51:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:13,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:13,767 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:13,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:51:13,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash -562947685, now seen corresponding path program 1 times [2025-03-04 01:51:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547700810] [2025-03-04 01:51:13,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:13,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:13,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:13,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:13,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:13,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:51:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547700810] [2025-03-04 01:51:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547700810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:13,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793444401] [2025-03-04 01:51:13,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:13,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:51:13,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:51:13,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:51:13,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:51:14,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:14,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:14,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:14,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:14,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:51:14,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:51:14,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:14,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793444401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:51:14,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:51:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063827787] [2025-03-04 01:51:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:14,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:51:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:14,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:51:14,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:51:14,126 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:14,149 INFO L93 Difference]: Finished difference Result 194 states and 281 transitions. [2025-03-04 01:51:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:51:14,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:51:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:14,151 INFO L225 Difference]: With dead ends: 194 [2025-03-04 01:51:14,151 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 01:51:14,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:51:14,154 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:14,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 01:51:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 01:51:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2025-03-04 01:51:14,165 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 84 [2025-03-04 01:51:14,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:14,165 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2025-03-04 01:51:14,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2025-03-04 01:51:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:14,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:14,167 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:14,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:51:14,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 01:51:14,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:14,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -211908908, now seen corresponding path program 1 times [2025-03-04 01:51:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:14,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53273813] [2025-03-04 01:51:14,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:14,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:14,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:14,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:14,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:51:14,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53273813] [2025-03-04 01:51:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53273813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382890465] [2025-03-04 01:51:14,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:14,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:51:14,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:51:14,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:51:14,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:51:14,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:14,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:14,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:14,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:14,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:51:14,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:51:14,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:14,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382890465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:14,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:51:14,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:51:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703758726] [2025-03-04 01:51:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:14,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:51:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:14,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:51:14,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:51:14,687 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:14,719 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-03-04 01:51:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:51:14,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:51:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:14,721 INFO L225 Difference]: With dead ends: 200 [2025-03-04 01:51:14,721 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:51:14,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:51:14,723 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:14,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:51:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-03-04 01:51:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-03-04 01:51:14,731 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 84 [2025-03-04 01:51:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:14,731 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-03-04 01:51:14,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-03-04 01:51:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:14,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:14,734 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:14,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:51:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:51:14,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:14,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash 791470683, now seen corresponding path program 1 times [2025-03-04 01:51:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388796692] [2025-03-04 01:51:14,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:14,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:15,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:15,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:15,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:51:15,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:51:15,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:15,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:15,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:15,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:51:15,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:51:15,116 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:51:15,116 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:51:15,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:51:15,121 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 01:51:15,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:51:15,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:51:15 BoogieIcfgContainer [2025-03-04 01:51:15,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:51:15,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:51:15,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:51:15,216 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:51:15,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:12" (3/4) ... [2025-03-04 01:51:15,218 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:51:15,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:51:15,219 INFO L158 Benchmark]: Toolchain (without parser) took 3975.07ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.3MB in the beginning and 174.9MB in the end (delta: -69.6MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2025-03-04 01:51:15,219 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:51:15,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.69ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 90.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:51:15,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.95ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:51:15,220 INFO L158 Benchmark]: Boogie Preprocessor took 60.25ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:51:15,220 INFO L158 Benchmark]: IcfgBuilder took 513.40ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 56.5MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:51:15,220 INFO L158 Benchmark]: TraceAbstraction took 3135.39ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 56.5MB in the beginning and 175.0MB in the end (delta: -118.4MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2025-03-04 01:51:15,220 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 302.0MB. Free memory was 175.0MB in the beginning and 174.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:51:15,221 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.29ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.69ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 90.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.95ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.25ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 513.40ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 56.5MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3135.39ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 56.5MB in the beginning and 175.0MB in the end (delta: -118.4MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 302.0MB. Free memory was 175.0MB in the beginning and 174.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 74. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] double* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L47] signed char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L48] signed char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L49] signed char* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L50] signed long int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L51] unsigned char* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L52] unsigned char* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L53] double* WrapperStruct0_var_1_15_Pointer = &(WrapperStruct0.var_1_15); [L54] signed long int last_1_WrapperStruct0_var_1_12 = 8; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=0, last_1_WrapperStruct0_var_1_12=8] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR WrapperStruct0.var_1_12 [L101] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L85] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L86] EXPR WrapperStruct0.var_1_8 [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L86] EXPR WrapperStruct0.var_1_8 [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L87] WrapperStruct0.var_1_10 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] CALL assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] RET assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L90] WrapperStruct0.var_1_11 = __VERIFIER_nondet_char() [L91] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L93] WrapperStruct0.var_1_13 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] CALL assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] RET assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L96] WrapperStruct0.var_1_14 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L97] CALL assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L97] RET assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] CALL assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] RET assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L112] RET updateVariables() [L113] CALL step() [L58] COND FALSE !(-4 > last_1_WrapperStruct0_var_1_12) [L63] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L63] (*(WrapperStruct0_var_1_9_Pointer)) = (*(WrapperStruct0_var_1_10_Pointer)) [L65] EXPR \read(*WrapperStruct0_var_1_13_Pointer) [L65] unsigned char stepLocal_0 = ! (*(WrapperStruct0_var_1_13_Pointer)); [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) [L66] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L66] COND FALSE !(stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer))) [L73] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L73] (*(WrapperStruct0_var_1_15_Pointer)) = (*(WrapperStruct0_var_1_8_Pointer)) [L74] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L74] EXPR \read(*WrapperStruct0_var_1_15_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L74] COND FALSE !((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) [L79] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L79] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer)) [L80] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L80] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_8_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_15_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104-L105] return (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 1908 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1269 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 639 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=5, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 1118/1152 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-03-04 01:51:15,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:51:17,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:51:17,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:51:17,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:51:17,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:51:17,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:51:17,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:51:17,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:51:17,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:51:17,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:51:17,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:51:17,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:51:17,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:51:17,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:51:17,211 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:51:17,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:51:17,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:51:17,212 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:51:17,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:51:17,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:51:17,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:51:17,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:51:17,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:51:17,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:51:17,213 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:51:17,213 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:51:17,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:51:17,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:51:17,213 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:51:17,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:51:17,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:51:17,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:51:17,214 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:51:17,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:51:17,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:51:17,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:51:17,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:51:17,215 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/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 -> 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af [2025-03-04 01:51:17,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:51:17,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:51:17,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:51:17,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:51:17,446 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:51:17,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2025-03-04 01:51:18,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d175ee0c/54c204ac6e6045fe8e50ae6a17423cfd/FLAG550d83241 [2025-03-04 01:51:18,854 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:51:18,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2025-03-04 01:51:18,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d175ee0c/54c204ac6e6045fe8e50ae6a17423cfd/FLAG550d83241 [2025-03-04 01:51:18,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d175ee0c/54c204ac6e6045fe8e50ae6a17423cfd [2025-03-04 01:51:18,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:51:18,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:51:18,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:51:18,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:51:18,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:51:18,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:51:18" (1/1) ... [2025-03-04 01:51:18,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe9f841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:18, skipping insertion in model container [2025-03-04 01:51:18,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:51:18" (1/1) ... [2025-03-04 01:51:18,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:51:19,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2025-03-04 01:51:19,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:51:19,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:51:19,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2025-03-04 01:51:19,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:51:19,132 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:51:19,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19 WrapperNode [2025-03-04 01:51:19,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:51:19,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:51:19,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:51:19,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:51:19,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,185 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2025-03-04 01:51:19,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:51:19,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:51:19,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:51:19,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:51:19,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,226 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2025-03-04 01:51:19,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:51:19,259 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:51:19,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:51:19,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:51:19,260 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (1/1) ... [2025-03-04 01:51:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:51:19,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:51:19,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:51:19,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:51:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:51:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:51:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:51:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:51:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:51:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:51:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:51:19,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:51:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:51:19,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:51:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:51:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:51:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:51:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:51:19,409 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:51:19,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:51:19,917 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite85#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~ite123#1;havoc property_#t~mem102#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:51:19,952 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-04 01:51:19,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:51:19,961 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:51:19,961 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:51:19,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:19 BoogieIcfgContainer [2025-03-04 01:51:19,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:51:19,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:51:19,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:51:19,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:51:19,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:51:18" (1/3) ... [2025-03-04 01:51:19,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba17b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:51:19, skipping insertion in model container [2025-03-04 01:51:19,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:19" (2/3) ... [2025-03-04 01:51:19,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba17b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:51:19, skipping insertion in model container [2025-03-04 01:51:19,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:19" (3/3) ... [2025-03-04 01:51:19,970 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2025-03-04 01:51:19,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:51:19,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:51:20,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:51:20,030 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;@53e11ba6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:51:20,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:51:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:20,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:20,043 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:20,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:20,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash -361994844, now seen corresponding path program 1 times [2025-03-04 01:51:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:20,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526057656] [2025-03-04 01:51:20,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:20,056 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-03-04 01:51:20,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:20,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:51:20,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:51:20,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:20,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:20,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:20,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:20,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:51:20,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:51:20,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:20,343 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:20,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526057656] [2025-03-04 01:51:20,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526057656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:20,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:20,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:51:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784173774] [2025-03-04 01:51:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:20,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:51:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:20,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:51:20,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:51:20,368 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:51:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:20,384 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-03-04 01:51:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:51:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-04 01:51:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:20,393 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:51:20,393 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:51:20,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-03-04 01:51:20,399 INFO L435 NwaCegarLoop]: 134 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, 134 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-03-04 01:51:20,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:51:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 01:51:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-03-04 01:51:20,434 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-03-04 01:51:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:20,435 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-03-04 01:51:20,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:51:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-03-04 01:51:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:20,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:20,437 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:20,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:51:20,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:51:20,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:20,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash -692953925, now seen corresponding path program 1 times [2025-03-04 01:51:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:20,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255669442] [2025-03-04 01:51:20,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:20,640 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-03-04 01:51:20,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:20,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:51:20,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:51:20,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:20,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:20,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:20,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:20,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:51:20,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:51:20,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:20,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:20,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255669442] [2025-03-04 01:51:20,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255669442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:20,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:20,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:51:20,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377986478] [2025-03-04 01:51:20,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:20,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:51:20,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:20,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:51:20,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:20,907 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:20,976 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2025-03-04 01:51:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:51:20,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:51:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:20,980 INFO L225 Difference]: With dead ends: 186 [2025-03-04 01:51:20,980 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:51:20,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:20,981 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:20,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:51:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-04 01:51:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-04 01:51:20,988 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2025-03-04 01:51:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:20,989 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-04 01:51:20,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-04 01:51:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:20,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:20,990 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:20,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:51:21,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:51:21,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:21,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash -692030404, now seen corresponding path program 1 times [2025-03-04 01:51:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629074490] [2025-03-04 01:51:21,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:21,196 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-03-04 01:51:21,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:21,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:51:21,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:51:21,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:21,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:21,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:21,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:21,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:51:21,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:21,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:51:21,506 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 136 treesize of output 46 [2025-03-04 01:51:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:51:21,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:21,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:21,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629074490] [2025-03-04 01:51:21,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629074490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:21,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:21,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:51:21,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83868485] [2025-03-04 01:51:21,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:21,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:51:21,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:21,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:51:21,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:21,582 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:23,722 INFO L93 Difference]: Finished difference Result 231 states and 331 transitions. [2025-03-04 01:51:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:51:23,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:51:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:23,724 INFO L225 Difference]: With dead ends: 231 [2025-03-04 01:51:23,725 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:51:23,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:51:23,725 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 57 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:23,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 335 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 01:51:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:51:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2025-03-04 01:51:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-03-04 01:51:23,731 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2025-03-04 01:51:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:23,733 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-03-04 01:51:23,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-03-04 01:51:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:23,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:23,734 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:23,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:51:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:51:23,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -211908908, now seen corresponding path program 1 times [2025-03-04 01:51:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:23,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943004170] [2025-03-04 01:51:23,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:23,936 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-03-04 01:51:23,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:23,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:51:23,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:51:23,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:24,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:24,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:24,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:24,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:51:24,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:51:24,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:24,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:24,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943004170] [2025-03-04 01:51:24,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943004170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:24,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:51:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809642984] [2025-03-04 01:51:24,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:24,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:51:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:24,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:51:24,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:24,111 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:24,140 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-03-04 01:51:24,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:51:24,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:51:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:24,141 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:51:24,141 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:51:24,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:24,144 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:24,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:51:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:51:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:51:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-04 01:51:24,155 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 84 [2025-03-04 01:51:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:24,156 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-04 01:51:24,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-04 01:51:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:24,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:24,157 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:24,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:51:24,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:51:24,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:24,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash 791470683, now seen corresponding path program 1 times [2025-03-04 01:51:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032451246] [2025-03-04 01:51:24,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:24,359 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-03-04 01:51:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:24,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:51:24,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:51:24,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:24,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:24,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:24,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:24,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:51:24,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:24,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:51:25,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2025-03-04 01:51:25,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2025-03-04 01:51:26,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2025-03-04 01:51:26,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 74 [2025-03-04 01:51:27,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 77 [2025-03-04 01:51:27,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:51:27,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 70 [2025-03-04 01:51:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 01:51:27,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:51:28,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:28,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032451246] [2025-03-04 01:51:28,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032451246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:28,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [84313438] [2025-03-04 01:51:28,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:28,037 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:51:28,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:51:28,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:51:28,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-04 01:51:28,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:29,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:29,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:29,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:29,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 01:51:29,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:29,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:51:30,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-03-04 01:51:31,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-03-04 01:51:31,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-03-04 01:51:32,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-03-04 01:51:33,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 01:51:33,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2025-03-04 01:51:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 01:51:33,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:51:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [84313438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:34,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:51:34,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2025-03-04 01:51:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734087015] [2025-03-04 01:51:34,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:51:34,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:51:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:34,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:51:34,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:51:34,394 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:51:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:38,704 INFO L93 Difference]: Finished difference Result 301 states and 422 transitions. [2025-03-04 01:51:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:51:38,704 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 84 [2025-03-04 01:51:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:38,706 INFO L225 Difference]: With dead ends: 301 [2025-03-04 01:51:38,706 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 01:51:38,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 186 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:51:38,707 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 747 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:38,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 817 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 01:51:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 01:51:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 143. [2025-03-04 01:51:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 120 states have internal predecessors, (161), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:51:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 197 transitions. [2025-03-04 01:51:38,722 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 197 transitions. Word has length 84 [2025-03-04 01:51:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:38,723 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 197 transitions. [2025-03-04 01:51:38,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:51:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 197 transitions. [2025-03-04 01:51:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:51:38,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:38,726 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:38,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-04 01:51:38,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:51:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:51:39,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:39,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 911590556, now seen corresponding path program 1 times [2025-03-04 01:51:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981225076] [2025-03-04 01:51:39,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:39,128 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-03-04 01:51:39,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:39,131 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:51:39,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:51:39,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:51:39,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:51:39,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:39,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:39,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:51:39,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:51:39,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:39,295 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981225076] [2025-03-04 01:51:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981225076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:39,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:39,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:51:39,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434441026] [2025-03-04 01:51:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:39,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:51:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:39,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:51:39,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:51:39,296 INFO L87 Difference]: Start difference. First operand 143 states and 197 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:39,345 INFO L93 Difference]: Finished difference Result 283 states and 391 transitions. [2025-03-04 01:51:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:51:39,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:51:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:39,347 INFO L225 Difference]: With dead ends: 283 [2025-03-04 01:51:39,347 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 01:51:39,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-03-04 01:51:39,348 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:39,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 01:51:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-04 01:51:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 120 states have internal predecessors, (160), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:51:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 196 transitions. [2025-03-04 01:51:39,362 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 196 transitions. Word has length 84 [2025-03-04 01:51:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 196 transitions. [2025-03-04 01:51:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:51:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2025-03-04 01:51:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 01:51:39,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:39,363 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:39,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:51:39,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:51:39,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:39,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash -293158356, now seen corresponding path program 1 times [2025-03-04 01:51:39,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:39,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963903996] [2025-03-04 01:51:39,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:39,565 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-03-04 01:51:39,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:39,567 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:51:39,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:51:39,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 01:51:39,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 01:51:39,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:39,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:39,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:51:39,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:39,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:51:40,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2025-03-04 01:51:40,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2025-03-04 01:51:41,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2025-03-04 01:51:41,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2025-03-04 01:51:42,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2025-03-04 01:51:42,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2025-03-04 01:51:42,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:51:42,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 66 [2025-03-04 01:51:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 56 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 01:51:42,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:51:43,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963903996] [2025-03-04 01:51:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963903996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [121009046] [2025-03-04 01:51:43,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:43,021 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:51:43,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:51:43,023 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:51:43,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:51:43,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 01:51:44,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 01:51:44,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:44,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:44,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 01:51:44,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:44,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-03-04 01:51:45,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 59 [2025-03-04 01:51:46,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 67 [2025-03-04 01:51:47,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 84 [2025-03-04 01:51:47,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 95 [2025-03-04 01:51:48,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 98 [2025-03-04 01:51:48,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 98 [2025-03-04 01:51:49,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 135 [2025-03-04 01:51:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 56 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 01:51:50,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:51:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [121009046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:51,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:51:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2025-03-04 01:51:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101263602] [2025-03-04 01:51:51,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:51:51,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 01:51:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:51,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 01:51:51,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:51:51,325 INFO L87 Difference]: Start difference. First operand 143 states and 196 transitions. Second operand has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 22 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 01:51:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:56,064 INFO L93 Difference]: Finished difference Result 349 states and 479 transitions. [2025-03-04 01:51:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:51:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 22 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 85 [2025-03-04 01:51:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:56,068 INFO L225 Difference]: With dead ends: 349 [2025-03-04 01:51:56,068 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 01:51:56,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 184 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 01:51:56,070 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1030 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:56,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 764 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-04 01:51:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 01:51:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 155. [2025-03-04 01:51:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 131 states have internal predecessors, (176), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:51:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 212 transitions. [2025-03-04 01:51:56,087 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 212 transitions. Word has length 85 [2025-03-04 01:51:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:56,087 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 212 transitions. [2025-03-04 01:51:56,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 22 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 01:51:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 212 transitions. [2025-03-04 01:51:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:51:56,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:56,088 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:51:56,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:51:56,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-04 01:51:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:51:56,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -158299719, now seen corresponding path program 1 times [2025-03-04 01:51:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961652807] [2025-03-04 01:51:56,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:56,490 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-03-04 01:51:56,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:56,492 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:51:56,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:51:56,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:51:56,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:51:56,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:56,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:56,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:51:56,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:56,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:51:57,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 61 [2025-03-04 01:51:57,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2025-03-04 01:51:58,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2025-03-04 01:51:58,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2025-03-04 01:51:58,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2025-03-04 01:51:58,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:51:58,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 64 [2025-03-04 01:51:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:51:58,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:51:59,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961652807] [2025-03-04 01:51:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961652807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [975213678] [2025-03-04 01:51:59,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:59,156 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:51:59,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:51:59,179 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:51:59,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-04 01:51:59,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:52:00,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:52:00,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:00,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:00,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 01:52:00,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:00,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:52:02,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 69 [2025-03-04 01:52:03,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2025-03-04 01:52:03,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2025-03-04 01:52:04,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2025-03-04 01:52:05,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 01:52:08,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 71 [2025-03-04 01:52:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:52:08,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:52:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [975213678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:52:09,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:52:09,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2025-03-04 01:52:09,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325034964] [2025-03-04 01:52:09,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:52:09,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 01:52:09,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:52:09,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 01:52:09,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:52:09,220 INFO L87 Difference]: Start difference. First operand 155 states and 212 transitions. Second operand has 28 states, 26 states have (on average 3.269230769230769) internal successors, (85), 23 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:52:14,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:52:17,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:52:21,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:52:25,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:52:48,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]