./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-p_file-43.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 57117faf8b5536f0bc31d50d8b3fc088981041e0046fd7f8eb4df8fb69ba7a8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:46:26,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:46:26,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:46:26,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:46:26,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:46:26,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:46:26,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:46:26,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:46:26,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:46:26,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:46:26,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:46:26,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:46:26,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:46:26,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:46:26,326 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:46:26,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:46:26,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:46:26,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:46:26,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:46:26,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:46:26,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:46:26,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:46:26,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:26,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:46:26,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:46:26,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:46:26,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:46:26,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:46:26,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:46:26,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:46:26,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:46:26,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:46:26,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:46:26,329 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 -> 57117faf8b5536f0bc31d50d8b3fc088981041e0046fd7f8eb4df8fb69ba7a8a [2025-03-17 05:46:26,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:46:26,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:46:26,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:46:26,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:46:26,595 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:46:26,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i [2025-03-17 05:46:27,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb37d3f9/e6413e1127994eefac07713a3827e8e1/FLAGaa0a11996 [2025-03-17 05:46:28,058 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:46:28,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i [2025-03-17 05:46:28,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb37d3f9/e6413e1127994eefac07713a3827e8e1/FLAGaa0a11996 [2025-03-17 05:46:28,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb37d3f9/e6413e1127994eefac07713a3827e8e1 [2025-03-17 05:46:28,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:46:28,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:46:28,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:28,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:46:28,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:46:28,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28, skipping insertion in model container [2025-03-17 05:46:28,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:46:28,243 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-p_file-43.i[916,929] [2025-03-17 05:46:28,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:28,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:46:28,330 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-p_file-43.i[916,929] [2025-03-17 05:46:28,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:28,377 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:46:28,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28 WrapperNode [2025-03-17 05:46:28,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:28,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:28,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:46:28,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:46:28,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,436 INFO L138 Inliner]: procedures = 29, calls = 193, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 588 [2025-03-17 05:46:28,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:28,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:46:28,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:46:28,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:46:28,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,480 INFO L175 MemorySlicer]: Split 144 memory accesses to 19 slices as follows [2, 9, 8, 10, 10, 10, 10, 6, 6, 6, 15, 12, 3, 6, 3, 9, 6, 7, 6]. 10 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 21 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-17 05:46:28,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:46:28,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:46:28,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:46:28,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:46:28,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (1/1) ... [2025-03-17 05:46:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:28,558 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-17 05:46:28,560 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-17 05:46:28,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:46:28,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:46:28,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:46:28,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:46:28,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:46:28,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:46:28,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:46:28,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:46:28,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:46:28,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:46:28,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:46:28,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:46:28,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:46:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-17 05:46:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-17 05:46:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-17 05:46:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-17 05:46:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-03-17 05:46:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2025-03-17 05:46:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2025-03-17 05:46:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2025-03-17 05:46:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:46:28,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:46:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:46:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-17 05:46:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:46:28,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:46:28,763 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:46:28,765 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:46:29,191 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite115#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem109#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~bitwise118#1;havoc property_#t~ite127#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short128#1;havoc property_#t~mem132#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~bitwise131#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~short147#1; [2025-03-17 05:46:29,242 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-17 05:46:29,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:46:29,256 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:46:29,257 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:46:29,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:29 BoogieIcfgContainer [2025-03-17 05:46:29,257 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:46:29,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:46:29,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:46:29,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:46:29,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:46:28" (1/3) ... [2025-03-17 05:46:29,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119cf88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:29, skipping insertion in model container [2025-03-17 05:46:29,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:28" (2/3) ... [2025-03-17 05:46:29,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119cf88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:29, skipping insertion in model container [2025-03-17 05:46:29,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:29" (3/3) ... [2025-03-17 05:46:29,265 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-43.i [2025-03-17 05:46:29,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:46:29,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-43.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:46:29,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:46:29,342 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;@39cd7722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:46:29,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:46:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:46:29,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:29,360 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:29,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1544075785, now seen corresponding path program 1 times [2025-03-17 05:46:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:29,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13845552] [2025-03-17 05:46:29,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:29,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:46:29,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:46:29,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:29,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:46:29,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:29,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13845552] [2025-03-17 05:46:29,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13845552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:29,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542443856] [2025-03-17 05:46:29,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:29,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:29,744 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-17 05:46:29,745 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-17 05:46:29,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:46:30,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:46:30,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:30,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:30,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:46:30,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:46:30,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:30,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542443856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:30,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:30,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:46:30,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630736858] [2025-03-17 05:46:30,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:30,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:46:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:30,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:46:30,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:30,080 INFO L87 Difference]: Start difference. First operand has 119 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:30,110 INFO L93 Difference]: Finished difference Result 235 states and 376 transitions. [2025-03-17 05:46:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:46:30,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 163 [2025-03-17 05:46:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:30,123 INFO L225 Difference]: With dead ends: 235 [2025-03-17 05:46:30,124 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 05:46:30,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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-17 05:46:30,130 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:30,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 05:46:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-17 05:46:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2025-03-17 05:46:30,166 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 163 [2025-03-17 05:46:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:30,166 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2025-03-17 05:46:30,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2025-03-17 05:46:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:46:30,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:30,171 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:30,179 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-17 05:46:30,372 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-17 05:46:30,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:30,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1178868313, now seen corresponding path program 1 times [2025-03-17 05:46:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:30,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698969760] [2025-03-17 05:46:30,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:30,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:46:30,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:46:30,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:30,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:30,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698969760] [2025-03-17 05:46:30,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698969760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:30,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:30,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:30,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639066271] [2025-03-17 05:46:30,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:30,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:30,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:30,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:30,757 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:30,808 INFO L93 Difference]: Finished difference Result 236 states and 353 transitions. [2025-03-17 05:46:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:30,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:46:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:30,810 INFO L225 Difference]: With dead ends: 236 [2025-03-17 05:46:30,810 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 05:46:30,811 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-17 05:46:30,811 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:30,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 05:46:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-17 05:46:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2025-03-17 05:46:30,828 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 163 [2025-03-17 05:46:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:30,829 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2025-03-17 05:46:30,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2025-03-17 05:46:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:46:30,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:30,830 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:30,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:46:30,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:30,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:30,831 INFO L85 PathProgramCache]: Analyzing trace with hash -628586150, now seen corresponding path program 1 times [2025-03-17 05:46:30,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:30,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689791842] [2025-03-17 05:46:30,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:30,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:30,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:46:30,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:46:30,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:30,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689791842] [2025-03-17 05:46:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689791842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:31,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:31,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132058738] [2025-03-17 05:46:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:31,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:31,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:31,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:31,040 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:31,083 INFO L93 Difference]: Finished difference Result 240 states and 357 transitions. [2025-03-17 05:46:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:31,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:46:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:31,085 INFO L225 Difference]: With dead ends: 240 [2025-03-17 05:46:31,086 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:46:31,086 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-17 05:46:31,087 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:31,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:46:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-17 05:46:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2025-03-17 05:46:31,097 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 163 [2025-03-17 05:46:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:31,097 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2025-03-17 05:46:31,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2025-03-17 05:46:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:46:31,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:31,100 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:31,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:46:31,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 258917531, now seen corresponding path program 1 times [2025-03-17 05:46:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:31,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344316624] [2025-03-17 05:46:31,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:31,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:31,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:46:31,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:46:31,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:31,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:31,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:31,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344316624] [2025-03-17 05:46:31,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344316624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:31,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:31,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:31,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523322890] [2025-03-17 05:46:31,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:31,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:31,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:31,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:31,303 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:31,340 INFO L93 Difference]: Finished difference Result 244 states and 361 transitions. [2025-03-17 05:46:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:31,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:46:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:31,342 INFO L225 Difference]: With dead ends: 244 [2025-03-17 05:46:31,344 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 05:46:31,345 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-17 05:46:31,345 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:31,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 05:46:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-03-17 05:46:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2025-03-17 05:46:31,354 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 163 [2025-03-17 05:46:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:31,355 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2025-03-17 05:46:31,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2025-03-17 05:46:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:46:31,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:31,357 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:31,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:46:31,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 259841052, now seen corresponding path program 1 times [2025-03-17 05:46:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104232455] [2025-03-17 05:46:31,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:31,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:46:31,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:46:31,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:31,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104232455] [2025-03-17 05:46:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104232455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759407976] [2025-03-17 05:46:31,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:31,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:31,912 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-17 05:46:31,913 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-17 05:46:32,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:46:32,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:46:32,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:32,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:32,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:46:32,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:32,376 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 15 treesize of output 1 [2025-03-17 05:46:32,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 05:46:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 301 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-17 05:46:32,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:32,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-17 05:46:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:32,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759407976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:46:32,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:46:32,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-03-17 05:46:32,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67765440] [2025-03-17 05:46:32,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:46:32,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:46:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:32,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:46:32,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:46:32,837 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 16 states have internal predecessors, (120), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (56), 5 states have call predecessors, (56), 7 states have call successors, (56) [2025-03-17 05:46:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:33,261 INFO L93 Difference]: Finished difference Result 251 states and 366 transitions. [2025-03-17 05:46:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:46:33,262 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 16 states have internal predecessors, (120), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (56), 5 states have call predecessors, (56), 7 states have call successors, (56) Word has length 163 [2025-03-17 05:46:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:33,263 INFO L225 Difference]: With dead ends: 251 [2025-03-17 05:46:33,263 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 05:46:33,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:46:33,264 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 583 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:33,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1007 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:46:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 05:46:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-03-17 05:46:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2025-03-17 05:46:33,280 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 163 [2025-03-17 05:46:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2025-03-17 05:46:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 16 states have internal predecessors, (120), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (56), 5 states have call predecessors, (56), 7 states have call successors, (56) [2025-03-17 05:46:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2025-03-17 05:46:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:33,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:33,283 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:33,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:46:33,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:33,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:33,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:33,488 INFO L85 PathProgramCache]: Analyzing trace with hash 849313639, now seen corresponding path program 1 times [2025-03-17 05:46:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:33,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106767815] [2025-03-17 05:46:33,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:33,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:33,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:33,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:33,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:33,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:34,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106767815] [2025-03-17 05:46:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106767815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219192280] [2025-03-17 05:46:34,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:34,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:34,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:34,079 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-17 05:46:34,081 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-17 05:46:34,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:34,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:34,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:34,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:34,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:46:34,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:34,427 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 15 treesize of output 1 [2025-03-17 05:46:34,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 05:46:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 301 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-17 05:46:34,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:34,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-17 05:46:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:34,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219192280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:46:34,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:46:34,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-03-17 05:46:34,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5652766] [2025-03-17 05:46:34,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:46:34,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:46:34,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:34,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:46:34,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:46:34,914 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 21 states, 18 states have (on average 6.055555555555555) internal successors, (109), 21 states have internal predecessors, (109), 6 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (56), 3 states have call predecessors, (56), 6 states have call successors, (56) [2025-03-17 05:46:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:35,412 INFO L93 Difference]: Finished difference Result 257 states and 370 transitions. [2025-03-17 05:46:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:46:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.055555555555555) internal successors, (109), 21 states have internal predecessors, (109), 6 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (56), 3 states have call predecessors, (56), 6 states have call successors, (56) Word has length 164 [2025-03-17 05:46:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:35,414 INFO L225 Difference]: With dead ends: 257 [2025-03-17 05:46:35,414 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 05:46:35,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:46:35,415 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 335 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:35,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1482 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:46:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 05:46:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-03-17 05:46:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 106 states have internal predecessors, (145), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 185 transitions. [2025-03-17 05:46:35,422 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 185 transitions. Word has length 164 [2025-03-17 05:46:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:35,423 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 185 transitions. [2025-03-17 05:46:35,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.055555555555555) internal successors, (109), 21 states have internal predecessors, (109), 6 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (56), 3 states have call predecessors, (56), 6 states have call successors, (56) [2025-03-17 05:46:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 185 transitions. [2025-03-17 05:46:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:35,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:35,424 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:35,433 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-17 05:46:35,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:35,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:35,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 782306886, now seen corresponding path program 1 times [2025-03-17 05:46:35,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:35,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989630005] [2025-03-17 05:46:35,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:35,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:35,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:35,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:35,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:35,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:36,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:36,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989630005] [2025-03-17 05:46:36,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989630005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:36,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:36,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:46:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163097968] [2025-03-17 05:46:36,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:36,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:46:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:36,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:46:36,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:46:36,181 INFO L87 Difference]: Start difference. First operand 129 states and 185 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:46:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:36,546 INFO L93 Difference]: Finished difference Result 265 states and 376 transitions. [2025-03-17 05:46:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:46:36,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 164 [2025-03-17 05:46:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:36,548 INFO L225 Difference]: With dead ends: 265 [2025-03-17 05:46:36,548 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 05:46:36,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:46:36,549 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 366 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:36,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 630 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 05:46:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2025-03-17 05:46:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 187 transitions. [2025-03-17 05:46:36,566 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 187 transitions. Word has length 164 [2025-03-17 05:46:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 187 transitions. [2025-03-17 05:46:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:46:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 187 transitions. [2025-03-17 05:46:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:36,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:36,568 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:36,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:46:36,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:36,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash 373482661, now seen corresponding path program 1 times [2025-03-17 05:46:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:36,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330190521] [2025-03-17 05:46:36,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:36,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:36,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:36,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:36,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:36,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330190521] [2025-03-17 05:46:36,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330190521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:36,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:36,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:36,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780713945] [2025-03-17 05:46:36,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:36,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:36,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:36,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:36,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:36,801 INFO L87 Difference]: Start difference. First operand 133 states and 187 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:36,914 INFO L93 Difference]: Finished difference Result 379 states and 532 transitions. [2025-03-17 05:46:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2025-03-17 05:46:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:36,916 INFO L225 Difference]: With dead ends: 379 [2025-03-17 05:46:36,916 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 05:46:36,917 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-17 05:46:36,917 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 143 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:36,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 602 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 05:46:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 137. [2025-03-17 05:46:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 193 transitions. [2025-03-17 05:46:36,933 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 193 transitions. Word has length 164 [2025-03-17 05:46:36,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:36,934 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 193 transitions. [2025-03-17 05:46:36,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 193 transitions. [2025-03-17 05:46:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:36,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:36,935 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:36,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:46:36,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:36,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash -137051516, now seen corresponding path program 1 times [2025-03-17 05:46:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:36,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473802148] [2025-03-17 05:46:36,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:36,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:36,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:36,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:37,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:37,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473802148] [2025-03-17 05:46:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473802148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:37,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839814989] [2025-03-17 05:46:37,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:37,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:37,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:37,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:46:37,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:46:37,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:37,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:37,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:37,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:37,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:46:37,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:37,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:37,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839814989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:37,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:37,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:46:37,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356835167] [2025-03-17 05:46:37,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:37,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:37,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:37,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:46:37,483 INFO L87 Difference]: Start difference. First operand 137 states and 193 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:37,525 INFO L93 Difference]: Finished difference Result 276 states and 389 transitions. [2025-03-17 05:46:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:37,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2025-03-17 05:46:37,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:37,527 INFO L225 Difference]: With dead ends: 276 [2025-03-17 05:46:37,527 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 05:46:37,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 164 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-17 05:46:37,528 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:37,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 05:46:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-17 05:46:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2025-03-17 05:46:37,539 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 164 [2025-03-17 05:46:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:37,539 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2025-03-17 05:46:37,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2025-03-17 05:46:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:37,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:37,541 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:37,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:46:37,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:37,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:37,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1184857385, now seen corresponding path program 1 times [2025-03-17 05:46:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:37,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064348457] [2025-03-17 05:46:37,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:37,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:37,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:37,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:37,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:37,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:37,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064348457] [2025-03-17 05:46:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064348457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:37,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068685759] [2025-03-17 05:46:37,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:37,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:37,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:37,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:37,936 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:38,074 INFO L93 Difference]: Finished difference Result 391 states and 545 transitions. [2025-03-17 05:46:38,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:38,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2025-03-17 05:46:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:38,076 INFO L225 Difference]: With dead ends: 391 [2025-03-17 05:46:38,076 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 05:46:38,077 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-17 05:46:38,077 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 142 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:38,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 602 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 05:46:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 141. [2025-03-17 05:46:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 197 transitions. [2025-03-17 05:46:38,091 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 197 transitions. Word has length 164 [2025-03-17 05:46:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:38,092 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 197 transitions. [2025-03-17 05:46:38,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 197 transitions. [2025-03-17 05:46:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:38,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:38,094 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:38,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:46:38,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:38,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 674323208, now seen corresponding path program 1 times [2025-03-17 05:46:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752099936] [2025-03-17 05:46:38,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:38,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:38,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:38,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:38,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:38,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752099936] [2025-03-17 05:46:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752099936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:46:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730866705] [2025-03-17 05:46:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:38,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:46:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:38,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:46:38,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:46:38,464 INFO L87 Difference]: Start difference. First operand 141 states and 197 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:38,597 INFO L93 Difference]: Finished difference Result 419 states and 586 transitions. [2025-03-17 05:46:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:46:38,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2025-03-17 05:46:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:38,601 INFO L225 Difference]: With dead ends: 419 [2025-03-17 05:46:38,601 INFO L226 Difference]: Without dead ends: 279 [2025-03-17 05:46:38,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:46:38,602 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 166 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:38,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1349 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-17 05:46:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2025-03-17 05:46:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 226 states have (on average 1.3407079646017699) internal successors, (303), 226 states have internal predecessors, (303), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:46:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 383 transitions. [2025-03-17 05:46:38,625 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 383 transitions. Word has length 164 [2025-03-17 05:46:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:38,626 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 383 transitions. [2025-03-17 05:46:38,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 383 transitions. [2025-03-17 05:46:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:38,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:38,628 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:38,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:46:38,629 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:38,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1374726822, now seen corresponding path program 1 times [2025-03-17 05:46:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:38,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831621586] [2025-03-17 05:46:38,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:38,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:38,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:38,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:38,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:39,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831621586] [2025-03-17 05:46:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831621586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:39,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:39,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:46:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865450199] [2025-03-17 05:46:39,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:39,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:46:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:39,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:46:39,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:46:39,037 INFO L87 Difference]: Start difference. First operand 273 states and 383 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:46:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:39,385 INFO L93 Difference]: Finished difference Result 553 states and 773 transitions. [2025-03-17 05:46:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:46:39,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 164 [2025-03-17 05:46:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:39,387 INFO L225 Difference]: With dead ends: 553 [2025-03-17 05:46:39,388 INFO L226 Difference]: Without dead ends: 281 [2025-03-17 05:46:39,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:46:39,389 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 363 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:39,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 625 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-17 05:46:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 273. [2025-03-17 05:46:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 226 states have (on average 1.331858407079646) internal successors, (301), 226 states have internal predecessors, (301), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:46:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 381 transitions. [2025-03-17 05:46:39,411 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 381 transitions. Word has length 164 [2025-03-17 05:46:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:39,412 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 381 transitions. [2025-03-17 05:46:39,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:46:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 381 transitions. [2025-03-17 05:46:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:39,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:39,413 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:39,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:46:39,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:39,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash 965902597, now seen corresponding path program 1 times [2025-03-17 05:46:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246488336] [2025-03-17 05:46:39,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:39,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:39,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:39,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:39,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246488336] [2025-03-17 05:46:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246488336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:39,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:39,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034878208] [2025-03-17 05:46:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:39,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:39,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:39,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:39,599 INFO L87 Difference]: Start difference. First operand 273 states and 381 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:39,707 INFO L93 Difference]: Finished difference Result 652 states and 908 transitions. [2025-03-17 05:46:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:39,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2025-03-17 05:46:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:39,710 INFO L225 Difference]: With dead ends: 652 [2025-03-17 05:46:39,710 INFO L226 Difference]: Without dead ends: 380 [2025-03-17 05:46:39,711 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-17 05:46:39,712 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 143 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:39,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 644 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-17 05:46:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 270. [2025-03-17 05:46:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 223 states have (on average 1.3273542600896862) internal successors, (296), 223 states have internal predecessors, (296), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:46:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 376 transitions. [2025-03-17 05:46:39,738 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 376 transitions. Word has length 164 [2025-03-17 05:46:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:39,738 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 376 transitions. [2025-03-17 05:46:39,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 376 transitions. [2025-03-17 05:46:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:39,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:39,740 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:39,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:46:39,740 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1777277321, now seen corresponding path program 1 times [2025-03-17 05:46:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:39,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200084387] [2025-03-17 05:46:39,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:39,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:39,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:39,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:39,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:39,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200084387] [2025-03-17 05:46:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200084387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:39,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:39,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565672440] [2025-03-17 05:46:39,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:39,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:39,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:39,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:39,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:39,931 INFO L87 Difference]: Start difference. First operand 270 states and 376 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:40,060 INFO L93 Difference]: Finished difference Result 646 states and 897 transitions. [2025-03-17 05:46:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:40,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2025-03-17 05:46:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:40,063 INFO L225 Difference]: With dead ends: 646 [2025-03-17 05:46:40,063 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 05:46:40,064 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-17 05:46:40,064 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 142 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:40,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 641 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 05:46:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 263. [2025-03-17 05:46:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:46:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 364 transitions. [2025-03-17 05:46:40,090 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 364 transitions. Word has length 164 [2025-03-17 05:46:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:40,090 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 364 transitions. [2025-03-17 05:46:40,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 364 transitions. [2025-03-17 05:46:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:46:40,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:40,092 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:40,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:46:40,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:40,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:40,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1266743144, now seen corresponding path program 1 times [2025-03-17 05:46:40,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:40,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189333955] [2025-03-17 05:46:40,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:40,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:40,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:40,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:40,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:46:40,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318564515] [2025-03-17 05:46:40,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:40,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:40,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:40,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:46:40,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:46:40,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:40,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:40,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:40,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:46:40,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:46:40,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:46:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:46:40,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:40,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:46:40,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:46:40,967 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:46:40,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:46:40,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:46:41,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 05:46:41,173 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:41,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:46:41,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:46:41 BoogieIcfgContainer [2025-03-17 05:46:41,399 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:46:41,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:46:41,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:46:41,400 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:46:41,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:29" (3/4) ... [2025-03-17 05:46:41,402 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:46:41,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:46:41,403 INFO L158 Benchmark]: Toolchain (without parser) took 13311.62ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 132.5MB in the beginning and 300.1MB in the end (delta: -167.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,404 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:41,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.67ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 117.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.97ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:41,404 INFO L158 Benchmark]: Boogie Preprocessor took 90.52ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 108.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,404 INFO L158 Benchmark]: IcfgBuilder took 729.03ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 61.6MB in the end (delta: 46.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,404 INFO L158 Benchmark]: TraceAbstraction took 12140.79ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 61.2MB in the beginning and 300.2MB in the end (delta: -239.0MB). Peak memory consumption was 168.2MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,405 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 369.1MB. Free memory was 300.2MB in the beginning and 300.1MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:41,405 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.33ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.67ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 117.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.97ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 90.52ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 108.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 729.03ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 61.6MB in the end (delta: 46.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12140.79ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 61.2MB in the beginning and 300.2MB in the end (delta: -239.0MB). Peak memory consumption was 168.2MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 369.1MB. Free memory was 300.2MB in the beginning and 300.1MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L22] signed short int var_1_1 = 64; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 4.5; [L24] float var_1_2 = 4.5; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 64.8; [L26] float var_1_3 = 64.8; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] float var_1_4 = 64.4; [L28] float var_1_4 = 64.4; [L29] float* var_1_4_Pointer = &(var_1_4); [L30] float var_1_5 = 0.2; [L30] float var_1_5 = 0.2; [L31] float* var_1_5_Pointer = &(var_1_5); [L32] signed short int var_1_7 = 10000; [L32] signed short int var_1_7 = 10000; [L33] signed short int* var_1_7_Pointer = &(var_1_7); [L34] signed short int var_1_8 = 1; [L34] signed short int var_1_8 = 1; [L35] signed short int* var_1_8_Pointer = &(var_1_8); [L36] signed short int var_1_9 = 50; [L36] signed short int var_1_9 = 50; [L37] signed short int* var_1_9_Pointer = &(var_1_9); [L38] signed short int var_1_10 = 8; [L38] signed short int var_1_10 = 8; [L39] signed short int* var_1_10_Pointer = &(var_1_10); [L40] unsigned char var_1_13 = 2; [L40] unsigned char var_1_13 = 2; [L41] unsigned char* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 100; [L42] unsigned char var_1_14 = 100; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned short int var_1_15 = 128; [L44] unsigned short int var_1_15 = 128; [L45] unsigned short int* var_1_15_Pointer = &(var_1_15); [L46] unsigned short int var_1_16 = 23647; [L46] unsigned short int var_1_16 = 23647; [L47] unsigned short int* var_1_16_Pointer = &(var_1_16); [L48] unsigned short int var_1_17 = 32; [L48] unsigned short int var_1_17 = 32; [L49] unsigned short int* var_1_17_Pointer = &(var_1_17); [L50] signed char var_1_18 = 0; [L50] signed char var_1_18 = 0; [L51] signed char* var_1_18_Pointer = &(var_1_18); [L52] signed char var_1_19 = -50; [L52] signed char var_1_19 = -50; [L53] signed char* var_1_19_Pointer = &(var_1_19); [L54] unsigned char var_1_20 = 0; [L54] unsigned char var_1_20 = 0; [L55] unsigned char* var_1_20_Pointer = &(var_1_20); [L56] unsigned char var_1_21 = 0; [L56] unsigned char var_1_21 = 0; [L57] unsigned char* var_1_21_Pointer = &(var_1_21); [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] FCALL updateLastVariables() [L134] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_float() [L91] EXPR \read(var_1_2) [L91] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F [L91] EXPR \read(var_1_2) [L91] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] var_1_3 = __VERIFIER_nondet_float() [L93] EXPR \read(var_1_3) [L93] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L93] EXPR \read(var_1_3) [L93] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] var_1_4 = __VERIFIER_nondet_float() [L95] EXPR \read(var_1_4) [L95] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F [L95] EXPR \read(var_1_4) [L95] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] var_1_5 = __VERIFIER_nondet_float() [L97] EXPR \read(var_1_5) [L97] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F [L97] EXPR \read(var_1_5) [L97] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] var_1_7 = __VERIFIER_nondet_short() [L99] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] var_1_8 = __VERIFIER_nondet_short() [L102] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_8 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_8 <= 8192) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] var_1_9 = __VERIFIER_nondet_short() [L105] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] CALL assume_abort_if_not(var_1_9 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] RET assume_abort_if_not(var_1_9 <= 8191) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] var_1_10 = __VERIFIER_nondet_short() [L108] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] var_1_14 = __VERIFIER_nondet_uchar() [L111] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L111] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L111] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] var_1_16 = __VERIFIER_nondet_ushort() [L114] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L116] var_1_19 = __VERIFIER_nondet_char() [L117] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L117] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L117] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L118] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L118] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L118] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L119] var_1_21 = __VERIFIER_nondet_uchar() [L120] EXPR \read(var_1_21) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L120] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L120] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR \read(var_1_21) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L134] RET updateVariables() [L135] CALL step() [L61] EXPR \read(*var_1_19_Pointer) [L61] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L62] EXPR \read(*var_1_21_Pointer) [L62] (*(var_1_20_Pointer)) = (*(var_1_21_Pointer)) [L63] EXPR \read(*var_1_18_Pointer) [L63] signed char stepLocal_1 = (*(var_1_18_Pointer)); [L64] EXPR \read(*var_1_9_Pointer) [L64] EXPR \read(*var_1_7_Pointer) [L64] signed long int stepLocal_0 = (*(var_1_9_Pointer)) / (*(var_1_7_Pointer)); [L65] EXPR \read(*var_1_8_Pointer) [L65] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L65] EXPR (*(var_1_8_Pointer)) << (*(var_1_10_Pointer)) VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L65] COND FALSE !(stepLocal_1 > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) [L72] EXPR \read(*var_1_7_Pointer) [L72] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] EXPR (*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)) VAL [isInitial=1, stepLocal_0=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] signed long int stepLocal_2 = (*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)); [L73] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L73] COND FALSE !((*(var_1_14_Pointer)) >= stepLocal_2) [L76] EXPR \read(*var_1_2_Pointer) [L76] EXPR \read(*var_1_3_Pointer) [L76] EXPR \read(*var_1_4_Pointer) [L76] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR (((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer)))) [L76] EXPR \read(*var_1_3_Pointer) [L76] EXPR (((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer)))) VAL [isInitial=1, stepLocal_0=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] COND TRUE (*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer)))))) [L77] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L77] COND FALSE !((*(var_1_20_Pointer))) [L87] EXPR \read(*var_1_1_Pointer) [L87] (*(var_1_17_Pointer)) = (*(var_1_1_Pointer)) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR \read(*var_1_2_Pointer) [L126] EXPR \read(*var_1_3_Pointer) [L126] EXPR \read(*var_1_4_Pointer) [L126] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR (((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer)))) [L126] EXPR \read(*var_1_3_Pointer) [L126] EXPR (((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR ((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer))))) [L126] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR (*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))) [L126] EXPR \read(*var_1_1_Pointer) [L126] EXPR \read(*var_1_13_Pointer) [L126] EXPR (*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR ((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR (((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR (((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR ((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR ((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR (((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1)) && ((*(var_1_17_Pointer)) == ((unsigned short int) (*(var_1_1_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR (((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1)) && ((*(var_1_17_Pointer)) == ((unsigned short int) (*(var_1_1_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR ((((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1)) && ((*(var_1_17_Pointer)) == ((unsigned short int) (*(var_1_1_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed char) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR ((((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1)) && ((*(var_1_17_Pointer)) == ((unsigned short int) (*(var_1_1_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed char) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR (((((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1)) && ((*(var_1_17_Pointer)) == ((unsigned short int) (*(var_1_1_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed char) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned char) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] EXPR (((((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1)) && ((*(var_1_17_Pointer)) == ((unsigned short int) (*(var_1_1_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed char) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned char) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126-L127] return (((((((*(var_1_2_Pointer)) != (((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))))) ? ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((*(var_1_7_Pointer)) - 32) + ((*(var_1_13_Pointer)) + (*(var_1_13_Pointer)))) - (*(var_1_13_Pointer))))) : 1) : ((*(var_1_20_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_13_Pointer)))))) && (((*(var_1_18_Pointer)) > ((*(var_1_8_Pointer)) << (*(var_1_10_Pointer)))) ? ((((*(var_1_9_Pointer)) / (*(var_1_7_Pointer))) > -25) ? ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : 1)) && (((*(var_1_14_Pointer)) >= ((*(var_1_7_Pointer)) ^ (*(var_1_18_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned short int) ((*(var_1_14_Pointer)) + ((*(var_1_16_Pointer)) - (*(var_1_13_Pointer)))))) : 1)) && ((*(var_1_17_Pointer)) == ((unsigned short int) (*(var_1_1_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed char) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned char) (*(var_1_21_Pointer)))) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 199 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 15, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2386 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2386 mSDsluCounter, 9885 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7506 mSDsCounter, 368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2111 IncrementalHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 368 mSolverCounterUnsat, 2379 mSDtfsCounter, 2111 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 989 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=11, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 470 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 3273 NumberOfCodeBlocks, 3273 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3252 ConstructedInterpolants, 0 QuantifiedInterpolants, 7545 SizeOfPredicates, 15 NumberOfNonLiveVariables, 3029 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 14359/15200 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-17 05:46:41,425 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-p_file-43.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 57117faf8b5536f0bc31d50d8b3fc088981041e0046fd7f8eb4df8fb69ba7a8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:46:43,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:46:43,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:46:43,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:46:43,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:46:43,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:46:43,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:46:43,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:46:43,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:46:43,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:46:43,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:46:43,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:46:43,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:46:43,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:46:43,487 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:46:43,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:46:43,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:46:43,487 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:46:43,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:46:43,488 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:46:43,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:43,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:46:43,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:46:43,489 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 -> 57117faf8b5536f0bc31d50d8b3fc088981041e0046fd7f8eb4df8fb69ba7a8a [2025-03-17 05:46:43,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:46:43,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:46:43,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:46:43,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:46:43,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:46:43,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i [2025-03-17 05:46:44,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c775646/2d1ab06008e94918bda2c23c60e57ea6/FLAG00ee6d62a [2025-03-17 05:46:45,158 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:46:45,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i [2025-03-17 05:46:45,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c775646/2d1ab06008e94918bda2c23c60e57ea6/FLAG00ee6d62a [2025-03-17 05:46:45,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c775646/2d1ab06008e94918bda2c23c60e57ea6 [2025-03-17 05:46:45,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:46:45,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:46:45,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:45,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:46:45,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:46:45,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1112d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45, skipping insertion in model container [2025-03-17 05:46:45,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:46:45,652 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-p_file-43.i[916,929] [2025-03-17 05:46:45,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:45,705 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:46:45,714 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-p_file-43.i[916,929] [2025-03-17 05:46:45,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:45,751 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:46:45,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45 WrapperNode [2025-03-17 05:46:45,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:45,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:45,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:46:45,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:46:45,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,810 INFO L138 Inliner]: procedures = 33, calls = 193, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 548 [2025-03-17 05:46:45,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:45,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:46:45,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:46:45,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:46:45,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,851 INFO L175 MemorySlicer]: Split 144 memory accesses to 19 slices as follows [2, 9, 8, 10, 10, 10, 10, 6, 6, 6, 15, 12, 3, 6, 3, 9, 6, 7, 6]. 10 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 21 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-17 05:46:45,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:46:45,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:46:45,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:46:45,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:46:45,907 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:45,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:45,937 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-17 05:46:45,940 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-17 05:46:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:46:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:46:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:46:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:46:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:46:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:46:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-17 05:46:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-03-17 05:46:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2025-03-17 05:46:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2025-03-17 05:46:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2025-03-17 05:46:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:46:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:46:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:46:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:46:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-17 05:46:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-03-17 05:46:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2025-03-17 05:46:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2025-03-17 05:46:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#17 [2025-03-17 05:46:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#18 [2025-03-17 05:46:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:46:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-17 05:46:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#17 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#18 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-17 05:46:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-17 05:46:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-17 05:46:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-17 05:46:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-17 05:46:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-17 05:46:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:46:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:46:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:46:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:46:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#17 [2025-03-17 05:46:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#18 [2025-03-17 05:46:46,243 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:46:46,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:46:47,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite113#1;havoc property_#t~mem100#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite124#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short125#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~short143#1; [2025-03-17 05:46:47,382 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-17 05:46:47,382 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:46:47,389 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:46:47,390 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:46:47,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:47 BoogieIcfgContainer [2025-03-17 05:46:47,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:46:47,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:46:47,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:46:47,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:46:47,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:46:45" (1/3) ... [2025-03-17 05:46:47,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634558d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:47, skipping insertion in model container [2025-03-17 05:46:47,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (2/3) ... [2025-03-17 05:46:47,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634558d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:47, skipping insertion in model container [2025-03-17 05:46:47,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:47" (3/3) ... [2025-03-17 05:46:47,396 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-43.i [2025-03-17 05:46:47,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:46:47,408 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-43.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:46:47,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:46:47,455 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;@45106de1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:46:47,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:46:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 84 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:46:47,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:47,468 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:47,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1476087836, now seen corresponding path program 1 times [2025-03-17 05:46:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:47,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979085532] [2025-03-17 05:46:47,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:47,483 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-17 05:46:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:47,485 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-17 05:46:47,487 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-17 05:46:47,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:46:48,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:46:48,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:48,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:48,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:46:48,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-17 05:46:48,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:48,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:48,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979085532] [2025-03-17 05:46:48,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979085532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:48,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:46:48,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32465342] [2025-03-17 05:46:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:46:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:48,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:46:48,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:48,150 INFO L87 Difference]: Start difference. First operand has 106 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 84 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:48,177 INFO L93 Difference]: Finished difference Result 209 states and 334 transitions. [2025-03-17 05:46:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:46:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-17 05:46:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:48,184 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:46:48,184 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:46:48,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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-17 05:46:48,191 INFO L435 NwaCegarLoop]: 154 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, 154 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-17 05:46:48,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:46:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 05:46:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2025-03-17 05:46:48,227 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 160 [2025-03-17 05:46:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:48,227 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2025-03-17 05:46:48,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2025-03-17 05:46:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:46:48,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:48,234 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:48,249 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-17 05:46:48,435 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-17 05:46:48,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:48,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 166572436, now seen corresponding path program 1 times [2025-03-17 05:46:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:48,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504467632] [2025-03-17 05:46:48,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:48,437 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-17 05:46:48,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:48,440 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-17 05:46:48,441 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-17 05:46:48,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:46:48,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:46:48,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:48,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:49,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:46:49,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:49,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:46:49,788 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 13 treesize of output 9 [2025-03-17 05:46:49,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:46:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:46:49,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:50,123 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:46:50,123 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 20 treesize of output 19 [2025-03-17 05:46:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:50,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:50,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504467632] [2025-03-17 05:46:50,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504467632] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:50,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-17 05:46:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766518702] [2025-03-17 05:46:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:50,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:46:50,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:50,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:46:50,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:46:50,447 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:50,842 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2025-03-17 05:46:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:46:50,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-17 05:46:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:50,844 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:46:50,845 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:46:50,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:46:50,846 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 525 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:50,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 285 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:46:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-03-17 05:46:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2025-03-17 05:46:50,862 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 160 [2025-03-17 05:46:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:50,862 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2025-03-17 05:46:50,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2025-03-17 05:46:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:46:50,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:50,864 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:50,877 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-17 05:46:51,068 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-17 05:46:51,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:51,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -242251789, now seen corresponding path program 1 times [2025-03-17 05:46:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947015495] [2025-03-17 05:46:51,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:51,070 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-17 05:46:51,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:51,071 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-17 05:46:51,073 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-17 05:46:51,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:46:51,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:46:51,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:51,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:51,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:46:51,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:52,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:46:52,079 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 13 treesize of output 9 [2025-03-17 05:46:52,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:46:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:46:52,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:52,393 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:46:52,393 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 20 treesize of output 19 [2025-03-17 05:46:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:52,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947015495] [2025-03-17 05:46:52,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947015495] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:52,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:52,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-17 05:46:52,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513570918] [2025-03-17 05:46:52,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:52,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:46:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:52,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:46:52,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:46:52,647 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:53,011 INFO L93 Difference]: Finished difference Result 217 states and 313 transitions. [2025-03-17 05:46:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:46:53,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-17 05:46:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:53,013 INFO L225 Difference]: With dead ends: 217 [2025-03-17 05:46:53,013 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:46:53,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:46:53,015 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 515 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:53,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 281 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:46:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-03-17 05:46:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-03-17 05:46:53,024 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 160 [2025-03-17 05:46:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:53,024 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-03-17 05:46:53,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-03-17 05:46:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:46:53,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:53,026 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:53,040 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-17 05:46:53,226 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-17 05:46:53,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:53,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash -752785966, now seen corresponding path program 1 times [2025-03-17 05:46:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997859075] [2025-03-17 05:46:53,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:53,228 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-17 05:46:53,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:53,230 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-17 05:46:53,231 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-17 05:46:53,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:46:53,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:46:53,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:53,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:53,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:46:53,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:53,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:53,760 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997859075] [2025-03-17 05:46:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997859075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610351472] [2025-03-17 05:46:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:53,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:53,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:53,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:53,762 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:53,807 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2025-03-17 05:46:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:46:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:53,808 INFO L225 Difference]: With dead ends: 217 [2025-03-17 05:46:53,808 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:46:53,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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-17 05:46:53,810 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:53,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:46:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 05:46:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2025-03-17 05:46:53,828 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 160 [2025-03-17 05:46:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:53,829 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2025-03-17 05:46:53,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2025-03-17 05:46:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:46:53,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:53,834 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:53,850 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-17 05:46:54,034 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-17 05:46:54,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:54,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash 569122935, now seen corresponding path program 1 times [2025-03-17 05:46:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108123426] [2025-03-17 05:46:54,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:54,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:54,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:54,037 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-17 05:46:54,038 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-17 05:46:54,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:46:54,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:46:54,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:54,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:54,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:46:54,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:54,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:46:54,959 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 13 treesize of output 9 [2025-03-17 05:46:55,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:46:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:46:55,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:55,184 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:46:55,184 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 20 treesize of output 19 [2025-03-17 05:46:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:46:55,403 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108123426] [2025-03-17 05:46:55,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108123426] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:55,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:55,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-17 05:46:55,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884652933] [2025-03-17 05:46:55,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:55,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:46:55,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:55,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:46:55,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:46:55,405 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:55,737 INFO L93 Difference]: Finished difference Result 221 states and 315 transitions. [2025-03-17 05:46:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:46:55,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-17 05:46:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:55,738 INFO L225 Difference]: With dead ends: 221 [2025-03-17 05:46:55,738 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:46:55,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:46:55,739 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 509 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:55,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 281 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:46:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-17 05:46:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:46:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2025-03-17 05:46:55,748 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 160 [2025-03-17 05:46:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:55,748 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2025-03-17 05:46:55,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:46:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2025-03-17 05:46:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:46:55,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:55,749 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:55,765 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-17 05:46:55,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-17 05:46:55,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:55,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 58588758, now seen corresponding path program 1 times [2025-03-17 05:46:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:55,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917791948] [2025-03-17 05:46:55,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:55,952 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-17 05:46:55,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:55,954 INFO L229 MonitoredProcess]: Starting monitored process 7 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-17 05:46:55,955 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 (7)] Waiting until timeout for monitored process [2025-03-17 05:46:56,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:46:56,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:46:56,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:56,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:56,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:46:56,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:56,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2025-03-17 05:46:56,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2025-03-17 05:46:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:56,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:56,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:56,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917791948] [2025-03-17 05:46:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917791948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:56,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:56,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:46:56,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109367111] [2025-03-17 05:46:56,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:56,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:46:56,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:56,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:46:56,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:46:56,969 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:57,253 INFO L93 Difference]: Finished difference Result 338 states and 480 transitions. [2025-03-17 05:46:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:46:57,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:46:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:57,255 INFO L225 Difference]: With dead ends: 338 [2025-03-17 05:46:57,257 INFO L226 Difference]: Without dead ends: 229 [2025-03-17 05:46:57,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:46:57,259 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:57,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 915 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-17 05:46:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2025-03-17 05:46:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.3089887640449438) internal successors, (233), 178 states have internal predecessors, (233), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:46:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 313 transitions. [2025-03-17 05:46:57,288 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 313 transitions. Word has length 160 [2025-03-17 05:46:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:57,288 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 313 transitions. [2025-03-17 05:46:57,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 313 transitions. [2025-03-17 05:46:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:46:57,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:57,291 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:57,307 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 (7)] Ended with exit code 0 [2025-03-17 05:46:57,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-17 05:46:57,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:57,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1748865705, now seen corresponding path program 1 times [2025-03-17 05:46:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:57,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301989687] [2025-03-17 05:46:57,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:57,493 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-17 05:46:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:57,495 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-17 05:46:57,496 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-17 05:46:57,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:46:57,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:46:57,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:57,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:57,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:46:57,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:58,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2025-03-17 05:46:58,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2025-03-17 05:46:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:46:58,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:58,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:58,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301989687] [2025-03-17 05:46:58,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301989687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:58,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:58,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:46:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291561018] [2025-03-17 05:46:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:58,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:46:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:58,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:46:58,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:46:58,514 INFO L87 Difference]: Start difference. First operand 223 states and 313 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:58,888 INFO L93 Difference]: Finished difference Result 455 states and 638 transitions. [2025-03-17 05:46:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:46:58,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:46:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:58,892 INFO L225 Difference]: With dead ends: 455 [2025-03-17 05:46:58,892 INFO L226 Difference]: Without dead ends: 233 [2025-03-17 05:46:58,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:46:58,893 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 69 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:58,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1029 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:46:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-17 05:46:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2025-03-17 05:46:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 182 states have (on average 1.3021978021978022) internal successors, (237), 182 states have internal predecessors, (237), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:46:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 317 transitions. [2025-03-17 05:46:58,908 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 317 transitions. Word has length 160 [2025-03-17 05:46:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:58,908 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 317 transitions. [2025-03-17 05:46:58,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:46:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 317 transitions. [2025-03-17 05:46:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:46:58,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:58,909 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:46:58,923 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-17 05:46:59,110 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-17 05:46:59,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:59,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash -861362024, now seen corresponding path program 1 times [2025-03-17 05:46:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:59,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704750897] [2025-03-17 05:46:59,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:59,111 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-17 05:46:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:59,112 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-17 05:46:59,113 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-17 05:46:59,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:46:59,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:46:59,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:59,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:59,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:46:59,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:00,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2025-03-17 05:47:00,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2025-03-17 05:47:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:47:00,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:00,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:00,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704750897] [2025-03-17 05:47:00,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704750897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:00,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:00,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:47:00,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614988941] [2025-03-17 05:47:00,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:00,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:47:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:00,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:47:00,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:47:00,129 INFO L87 Difference]: Start difference. First operand 227 states and 317 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:47:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:00,472 INFO L93 Difference]: Finished difference Result 463 states and 646 transitions. [2025-03-17 05:47:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:47:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:47:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:00,475 INFO L225 Difference]: With dead ends: 463 [2025-03-17 05:47:00,475 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 05:47:00,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:47:00,476 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 71 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:00,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1146 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:47:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 05:47:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2025-03-17 05:47:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 186 states have (on average 1.2956989247311828) internal successors, (241), 186 states have internal predecessors, (241), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:47:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 321 transitions. [2025-03-17 05:47:00,488 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 321 transitions. Word has length 160 [2025-03-17 05:47:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:00,488 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 321 transitions. [2025-03-17 05:47:00,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:47:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 321 transitions. [2025-03-17 05:47:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:47:00,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:00,490 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:47:00,504 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-17 05:47:00,690 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 [2025-03-17 05:47:00,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:00,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash -860438503, now seen corresponding path program 1 times [2025-03-17 05:47:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:00,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164420801] [2025-03-17 05:47:00,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:00,691 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-17 05:47:00,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:00,693 INFO L229 MonitoredProcess]: Starting monitored process 10 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-17 05:47:00,698 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 (10)] Waiting until timeout for monitored process [2025-03-17 05:47:00,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:47:01,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:47:01,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:01,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:01,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:47:01,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:01,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2025-03-17 05:47:01,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2025-03-17 05:47:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:47:01,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:01,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:01,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164420801] [2025-03-17 05:47:01,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164420801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:01,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:01,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:47:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15909794] [2025-03-17 05:47:01,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:01,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:47:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:01,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:47:01,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:47:01,212 INFO L87 Difference]: Start difference. First operand 231 states and 321 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:47:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:02,104 INFO L93 Difference]: Finished difference Result 545 states and 749 transitions. [2025-03-17 05:47:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:47:02,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:47:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:02,106 INFO L225 Difference]: With dead ends: 545 [2025-03-17 05:47:02,106 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 05:47:02,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:47:02,107 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 43 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:02,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 824 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:47:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 05:47:02,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 241. [2025-03-17 05:47:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.3010204081632653) internal successors, (255), 196 states have internal predecessors, (255), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:47:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 335 transitions. [2025-03-17 05:47:02,120 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 335 transitions. Word has length 160 [2025-03-17 05:47:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:02,121 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 335 transitions. [2025-03-17 05:47:02,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:47:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 335 transitions. [2025-03-17 05:47:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:47:02,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:02,122 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:47:02,135 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 (10)] Ended with exit code 0 [2025-03-17 05:47:02,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-17 05:47:02,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:02,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1857510856, now seen corresponding path program 1 times [2025-03-17 05:47:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:02,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466737922] [2025-03-17 05:47:02,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:02,324 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-17 05:47:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:02,325 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-17 05:47:02,326 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-17 05:47:02,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:47:02,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:47:02,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:02,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:02,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:47:02,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:02,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2025-03-17 05:47:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-03-17 05:47:02,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:02,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:02,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466737922] [2025-03-17 05:47:02,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466737922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:02,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:47:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703313213] [2025-03-17 05:47:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:02,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:47:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:02,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:47:02,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:47:02,891 INFO L87 Difference]: Start difference. First operand 241 states and 335 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:47:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:03,749 INFO L93 Difference]: Finished difference Result 483 states and 671 transitions. [2025-03-17 05:47:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:47:03,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-17 05:47:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:03,758 INFO L225 Difference]: With dead ends: 483 [2025-03-17 05:47:03,758 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 05:47:03,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:47:03,760 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 134 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:03,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 468 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:47:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 05:47:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2025-03-17 05:47:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.2908163265306123) internal successors, (253), 196 states have internal predecessors, (253), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:47:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 333 transitions. [2025-03-17 05:47:03,779 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 333 transitions. Word has length 160 [2025-03-17 05:47:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:03,779 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 333 transitions. [2025-03-17 05:47:03,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:47:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 333 transitions. [2025-03-17 05:47:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 05:47:03,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:03,781 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:47:03,796 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 (11)] Ended with exit code 0 [2025-03-17 05:47:03,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-17 05:47:03,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:03,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1147597190, now seen corresponding path program 1 times [2025-03-17 05:47:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:03,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367013635] [2025-03-17 05:47:03,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:03,982 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-17 05:47:03,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:03,984 INFO L229 MonitoredProcess]: Starting monitored process 12 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-17 05:47:03,985 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 (12)] Waiting until timeout for monitored process [2025-03-17 05:47:04,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 05:47:04,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 05:47:04,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:04,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:04,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:47:04,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:04,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2025-03-17 05:47:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2025-03-17 05:47:04,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:04,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367013635] [2025-03-17 05:47:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367013635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:04,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:04,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:47:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208787096] [2025-03-17 05:47:04,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:04,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:47:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:04,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:47:04,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:47:04,530 INFO L87 Difference]: Start difference. First operand 241 states and 333 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:47:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:05,296 INFO L93 Difference]: Finished difference Result 483 states and 667 transitions. [2025-03-17 05:47:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:47:05,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2025-03-17 05:47:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:05,310 INFO L225 Difference]: With dead ends: 483 [2025-03-17 05:47:05,310 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 05:47:05,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:47:05,311 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 125 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:05,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 464 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:47:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 05:47:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2025-03-17 05:47:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.280612244897959) internal successors, (251), 196 states have internal predecessors, (251), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:47:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 331 transitions. [2025-03-17 05:47:05,325 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 331 transitions. Word has length 162 [2025-03-17 05:47:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:05,326 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 331 transitions. [2025-03-17 05:47:05,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:47:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 331 transitions. [2025-03-17 05:47:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:47:05,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:05,328 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:47:05,345 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 (12)] Ended with exit code 0 [2025-03-17 05:47:05,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-17 05:47:05,529 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:05,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 275929528, now seen corresponding path program 1 times [2025-03-17 05:47:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:05,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722475317] [2025-03-17 05:47:05,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:05,530 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-17 05:47:05,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:05,532 INFO L229 MonitoredProcess]: Starting monitored process 13 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-17 05:47:05,533 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 (13)] Waiting until timeout for monitored process [2025-03-17 05:47:05,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:47:21,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:47:21,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:21,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:21,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 05:47:21,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:33,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 69 [2025-03-17 05:47:33,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 57 [2025-03-17 05:47:33,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2025-03-17 05:47:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 16 proven. 264 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:47:35,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:47:47,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:47,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722475317] [2025-03-17 05:47:47,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722475317] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:47,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:47:47,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 29 [2025-03-17 05:47:47,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200099660] [2025-03-17 05:47:47,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:47,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:47:47,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:47,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:47:47,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:47:47,645 INFO L87 Difference]: Start difference. First operand 241 states and 331 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)