./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.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 f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:10:37,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:10:37,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:10:37,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:10:37,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:10:37,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:10:37,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:10:37,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:10:37,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:10:37,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:10:37,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:10:37,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:10:37,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:10:37,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:10:37,124 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:10:37,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:10:37,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:10:37,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:10:37,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:10:37,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:10:37,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:10:37,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:10:37,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:10:37,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:10:37,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:10:37,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:10:37,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:10:37,127 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 -> f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 [2025-03-04 01:10:37,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:10:37,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:10:37,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:10:37,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:10:37,367 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:10:37,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2025-03-04 01:10:38,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2575b7c9/dbc066fd28d845acbc89718722c036c3/FLAG30a213945 [2025-03-04 01:10:38,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:10:38,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2025-03-04 01:10:38,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2575b7c9/dbc066fd28d845acbc89718722c036c3/FLAG30a213945 [2025-03-04 01:10:39,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2575b7c9/dbc066fd28d845acbc89718722c036c3 [2025-03-04 01:10:39,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:10:39,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:10:39,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:10:39,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:10:39,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:10:39,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa72034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39, skipping insertion in model container [2025-03-04 01:10:39,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:10:39,215 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-a_file-83.i[916,929] [2025-03-04 01:10:39,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:10:39,288 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:10:39,297 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-a_file-83.i[916,929] [2025-03-04 01:10:39,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:10:39,351 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:10:39,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39 WrapperNode [2025-03-04 01:10:39,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:10:39,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:10:39,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:10:39,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:10:39,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,407 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2025-03-04 01:10:39,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:10:39,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:10:39,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:10:39,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:10:39,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,445 INFO L175 MemorySlicer]: Split 130 memory accesses to 7 slices as follows [2, 6, 47, 21, 5, 9, 40]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 1, 1, 2]. The 16 writes are split as follows [0, 1, 7, 2, 1, 1, 4]. [2025-03-04 01:10:39,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:10:39,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:10:39,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:10:39,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:10:39,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (1/1) ... [2025-03-04 01:10:39,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:10:39,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:39,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:10:39,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:10:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:10:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:10:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:10:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:10:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:10:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:10:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:10:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:10:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:10:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:10:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:10:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:10:39,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:10:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:10:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:10:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:10:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:10:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:10:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:10:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:10:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:10:39,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:10:39,653 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:10:39,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:10:40,022 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem78#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite91#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite122#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~bitwise109#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-04 01:10:40,059 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2025-03-04 01:10:40,060 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:10:40,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:10:40,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:10:40,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:40 BoogieIcfgContainer [2025-03-04 01:10:40,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:10:40,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:10:40,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:10:40,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:10:40,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:10:39" (1/3) ... [2025-03-04 01:10:40,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690db504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:40, skipping insertion in model container [2025-03-04 01:10:40,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:39" (2/3) ... [2025-03-04 01:10:40,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690db504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:40, skipping insertion in model container [2025-03-04 01:10:40,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:40" (3/3) ... [2025-03-04 01:10:40,085 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-83.i [2025-03-04 01:10:40,096 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:10:40,098 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-83.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:10:40,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:10:40,149 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;@1917469e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:10:40,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:10:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:10:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:10:40,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:40,161 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:40,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:40,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -103576755, now seen corresponding path program 1 times [2025-03-04 01:10:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:40,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870872070] [2025-03-04 01:10:40,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:40,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:10:40,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:10:40,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:40,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:10:40,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:40,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870872070] [2025-03-04 01:10:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870872070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:40,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10206722] [2025-03-04 01:10:40,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:40,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:40,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:40,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:10:40,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:10:40,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:10:40,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:10:40,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:40,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:40,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:10:40,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:10:40,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:40,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10206722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:40,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:10:40,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:10:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961633316] [2025-03-04 01:10:40,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:40,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:10:40,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:40,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:10:40,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:40,653 INFO L87 Difference]: Start difference. First operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:40,674 INFO L93 Difference]: Finished difference Result 216 states and 334 transitions. [2025-03-04 01:10:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:10:40,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-03-04 01:10:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:40,682 INFO L225 Difference]: With dead ends: 216 [2025-03-04 01:10:40,682 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:10:40,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:40,689 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:40,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:10:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 01:10:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:10:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-03-04 01:10:40,725 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 106 [2025-03-04 01:10:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:40,725 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-03-04 01:10:40,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-03-04 01:10:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:10:40,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:40,727 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:40,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:10:40,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:10:40,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:40,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1453303562, now seen corresponding path program 1 times [2025-03-04 01:10:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901382126] [2025-03-04 01:10:40,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:40,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:10:41,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:10:41,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:41,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:41,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901382126] [2025-03-04 01:10:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901382126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:41,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881316892] [2025-03-04 01:10:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:41,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:41,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:41,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:41,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:41,207 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:41,252 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2025-03-04 01:10:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:10:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:41,254 INFO L225 Difference]: With dead ends: 216 [2025-03-04 01:10:41,254 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:10:41,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:41,255 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:41,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:10:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-04 01:10:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:10:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2025-03-04 01:10:41,269 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 106 [2025-03-04 01:10:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:41,270 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2025-03-04 01:10:41,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2025-03-04 01:10:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:10:41,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:41,271 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:41,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:10:41,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:41,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1034209271, now seen corresponding path program 1 times [2025-03-04 01:10:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814967973] [2025-03-04 01:10:41,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:41,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:10:41,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:10:41,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:41,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814967973] [2025-03-04 01:10:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814967973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381207707] [2025-03-04 01:10:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:41,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:41,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:41,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:41,426 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:41,464 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2025-03-04 01:10:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:41,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:10:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:41,467 INFO L225 Difference]: With dead ends: 220 [2025-03-04 01:10:41,469 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 01:10:41,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:41,470 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:41,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 434 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 01:10:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-04 01:10:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:10:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2025-03-04 01:10:41,481 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 106 [2025-03-04 01:10:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:41,481 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2025-03-04 01:10:41,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2025-03-04 01:10:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:10:41,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:41,482 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:10:41,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:41,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:41,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1921712952, now seen corresponding path program 1 times [2025-03-04 01:10:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307575072] [2025-03-04 01:10:41,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:41,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:41,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:10:41,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:10:41,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:41,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:41,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:41,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307575072] [2025-03-04 01:10:41,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307575072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:41,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:41,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960096870] [2025-03-04 01:10:41,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:41,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:41,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:41,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:41,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:41,610 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:41,638 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2025-03-04 01:10:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:41,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:10:41,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:41,640 INFO L225 Difference]: With dead ends: 224 [2025-03-04 01:10:41,641 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:10:41,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:41,642 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:41,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:10:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-04 01:10:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:10:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-03-04 01:10:41,650 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 106 [2025-03-04 01:10:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:41,651 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-03-04 01:10:41,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-03-04 01:10:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:10:41,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:41,653 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:41,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:10:41,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1922636473, now seen corresponding path program 1 times [2025-03-04 01:10:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002166281] [2025-03-04 01:10:41,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:41,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:10:41,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:10:41,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:41,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:41,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:41,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002166281] [2025-03-04 01:10:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002166281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:41,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:41,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:41,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800988188] [2025-03-04 01:10:41,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:41,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:41,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:41,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:41,868 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:41,919 INFO L93 Difference]: Finished difference Result 264 states and 370 transitions. [2025-03-04 01:10:41,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:41,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:10:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:41,921 INFO L225 Difference]: With dead ends: 264 [2025-03-04 01:10:41,921 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 01:10:41,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:41,922 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 148 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:41,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 446 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 01:10:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 114. [2025-03-04 01:10:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:10:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-03-04 01:10:41,938 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 106 [2025-03-04 01:10:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:41,938 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-03-04 01:10:41,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-03-04 01:10:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:10:41,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:41,940 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:41,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:10:41,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:41,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1626058029, now seen corresponding path program 1 times [2025-03-04 01:10:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:41,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809487634] [2025-03-04 01:10:41,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:41,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:10:41,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:10:41,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:41,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:42,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:42,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809487634] [2025-03-04 01:10:42,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809487634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:42,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:42,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81211902] [2025-03-04 01:10:42,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:42,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:42,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:42,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:42,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:42,151 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:42,228 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2025-03-04 01:10:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:42,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-03-04 01:10:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:42,230 INFO L225 Difference]: With dead ends: 227 [2025-03-04 01:10:42,230 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:10:42,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:42,230 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:42,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 539 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:10:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:10:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:10:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2025-03-04 01:10:42,234 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 107 [2025-03-04 01:10:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:42,235 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2025-03-04 01:10:42,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2025-03-04 01:10:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:10:42,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:42,236 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:42,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:10:42,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:42,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -885244556, now seen corresponding path program 1 times [2025-03-04 01:10:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:42,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850020699] [2025-03-04 01:10:42,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:42,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:42,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:42,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:42,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:42,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850020699] [2025-03-04 01:10:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850020699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:42,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:10:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061882304] [2025-03-04 01:10:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:42,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:10:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:10:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:10:42,829 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:43,065 INFO L93 Difference]: Finished difference Result 324 states and 448 transitions. [2025-03-04 01:10:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:10:43,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-04 01:10:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:43,067 INFO L225 Difference]: With dead ends: 324 [2025-03-04 01:10:43,068 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 01:10:43,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:10:43,071 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 110 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:43,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1017 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:10:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 01:10:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2025-03-04 01:10:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 188 states have (on average 1.351063829787234) internal successors, (254), 189 states have internal predecessors, (254), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:10:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 288 transitions. [2025-03-04 01:10:43,083 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 288 transitions. Word has length 108 [2025-03-04 01:10:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:43,083 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 288 transitions. [2025-03-04 01:10:43,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 288 transitions. [2025-03-04 01:10:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:10:43,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:43,084 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:43,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:10:43,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:43,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1395778733, now seen corresponding path program 1 times [2025-03-04 01:10:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:43,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019529613] [2025-03-04 01:10:43,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:43,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:43,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:43,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:43,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:10:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726118212] [2025-03-04 01:10:43,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:43,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:43,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:43,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:10:43,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:10:43,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:43,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:43,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:43,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:43,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:10:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:43,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:43,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019529613] [2025-03-04 01:10:43,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:10:43,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726118212] [2025-03-04 01:10:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726118212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:43,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328808604] [2025-03-04 01:10:43,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:43,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:43,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:43,468 INFO L87 Difference]: Start difference. First operand 208 states and 288 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:43,593 INFO L93 Difference]: Finished difference Result 590 states and 820 transitions. [2025-03-04 01:10:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:43,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-04 01:10:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:43,596 INFO L225 Difference]: With dead ends: 590 [2025-03-04 01:10:43,596 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 01:10:43,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:43,598 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 120 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:43,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 665 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 01:10:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 228. [2025-03-04 01:10:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 208 states have (on average 1.3653846153846154) internal successors, (284), 209 states have internal predecessors, (284), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:10:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2025-03-04 01:10:43,612 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 108 [2025-03-04 01:10:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:43,612 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2025-03-04 01:10:43,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2025-03-04 01:10:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:10:43,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:43,613 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:43,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:10:43,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 01:10:43,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:43,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash -42469036, now seen corresponding path program 1 times [2025-03-04 01:10:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:43,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313893516] [2025-03-04 01:10:43,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:43,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:43,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:43,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:43,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-04 01:10:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313893516] [2025-03-04 01:10:44,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313893516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344005480] [2025-03-04 01:10:44,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:44,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:10:44,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:10:44,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:44,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:44,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:44,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:44,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:10:45,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:45,109 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-04 01:10:45,350 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-04 01:10:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:10:45,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344005480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:45,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:10:45,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2025-03-04 01:10:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063687247] [2025-03-04 01:10:45,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:10:45,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:10:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:45,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:10:45,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:10:45,759 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 19 states, 16 states have (on average 6.625) internal successors, (106), 19 states have internal predecessors, (106), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) [2025-03-04 01:10:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:46,874 INFO L93 Difference]: Finished difference Result 727 states and 1012 transitions. [2025-03-04 01:10:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 01:10:46,874 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.625) internal successors, (106), 19 states have internal predecessors, (106), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) Word has length 108 [2025-03-04 01:10:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:46,876 INFO L225 Difference]: With dead ends: 727 [2025-03-04 01:10:46,876 INFO L226 Difference]: Without dead ends: 502 [2025-03-04 01:10:46,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 01:10:46,878 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 555 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:46,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1451 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:10:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-04 01:10:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 234. [2025-03-04 01:10:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 213 states have (on average 1.3568075117370892) internal successors, (289), 214 states have internal predecessors, (289), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:10:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 323 transitions. [2025-03-04 01:10:46,890 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 323 transitions. Word has length 108 [2025-03-04 01:10:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:46,890 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 323 transitions. [2025-03-04 01:10:46,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.625) internal successors, (106), 19 states have internal predecessors, (106), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) [2025-03-04 01:10:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 323 transitions. [2025-03-04 01:10:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:10:46,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:46,891 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:46,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:10:47,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:47,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:47,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash -684527435, now seen corresponding path program 1 times [2025-03-04 01:10:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:47,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355918852] [2025-03-04 01:10:47,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:47,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:47,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:47,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:47,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:47,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:47,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355918852] [2025-03-04 01:10:47,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355918852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:47,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:47,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247975913] [2025-03-04 01:10:47,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:47,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:47,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:47,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:47,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:47,392 INFO L87 Difference]: Start difference. First operand 234 states and 323 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:47,565 INFO L93 Difference]: Finished difference Result 508 states and 701 transitions. [2025-03-04 01:10:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:47,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-04 01:10:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:47,567 INFO L225 Difference]: With dead ends: 508 [2025-03-04 01:10:47,567 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 01:10:47,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:10:47,568 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 256 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:47,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 350 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 01:10:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 234. [2025-03-04 01:10:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 213 states have (on average 1.3474178403755868) internal successors, (287), 214 states have internal predecessors, (287), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:10:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 321 transitions. [2025-03-04 01:10:47,580 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 321 transitions. Word has length 108 [2025-03-04 01:10:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:47,580 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 321 transitions. [2025-03-04 01:10:47,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 321 transitions. [2025-03-04 01:10:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:10:47,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:47,581 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:47,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:10:47,584 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:47,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 213328596, now seen corresponding path program 1 times [2025-03-04 01:10:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:47,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438417931] [2025-03-04 01:10:47,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:47,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:47,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:47,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:47,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:10:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:48,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438417931] [2025-03-04 01:10:48,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438417931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:48,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:48,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:10:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71498498] [2025-03-04 01:10:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:48,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:10:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:48,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:10:48,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:10:48,287 INFO L87 Difference]: Start difference. First operand 234 states and 321 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:48,836 INFO L93 Difference]: Finished difference Result 573 states and 786 transitions. [2025-03-04 01:10:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:10:48,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-04 01:10:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:48,839 INFO L225 Difference]: With dead ends: 573 [2025-03-04 01:10:48,839 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 01:10:48,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:10:48,840 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 99 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:48,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1433 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:10:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 01:10:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 263. [2025-03-04 01:10:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 242 states have (on average 1.3553719008264462) internal successors, (328), 243 states have internal predecessors, (328), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:10:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 362 transitions. [2025-03-04 01:10:48,851 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 362 transitions. Word has length 108 [2025-03-04 01:10:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:48,851 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 362 transitions. [2025-03-04 01:10:48,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 362 transitions. [2025-03-04 01:10:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:10:48,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:48,856 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:48,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:10:48,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:48,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash -479773101, now seen corresponding path program 1 times [2025-03-04 01:10:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:48,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941682166] [2025-03-04 01:10:48,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:48,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:48,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:48,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:48,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:10:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423369032] [2025-03-04 01:10:48,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:48,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:48,903 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-04 01:10:48,905 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-04 01:10:49,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:10:49,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:10:49,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:49,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:49,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:10:49,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:49,274 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 21 treesize of output 9 [2025-03-04 01:10:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:49,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:49,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:49,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941682166] [2025-03-04 01:10:49,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:10:49,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423369032] [2025-03-04 01:10:49,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423369032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:49,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:49,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:49,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324711800] [2025-03-04 01:10:49,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:49,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:10:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:49,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:10:49,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:10:49,284 INFO L87 Difference]: Start difference. First operand 263 states and 362 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:49,596 INFO L93 Difference]: Finished difference Result 955 states and 1314 transitions. [2025-03-04 01:10:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:10:49,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-04 01:10:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:49,600 INFO L225 Difference]: With dead ends: 955 [2025-03-04 01:10:49,600 INFO L226 Difference]: Without dead ends: 695 [2025-03-04 01:10:49,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:10:49,601 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 281 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:49,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1211 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:10:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-04 01:10:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 315. [2025-03-04 01:10:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 281 states have (on average 1.3380782918149465) internal successors, (376), 282 states have internal predecessors, (376), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 432 transitions. [2025-03-04 01:10:49,633 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 432 transitions. Word has length 108 [2025-03-04 01:10:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:49,633 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 432 transitions. [2025-03-04 01:10:49,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 432 transitions. [2025-03-04 01:10:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:10:49,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:49,636 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:49,644 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-04 01:10:49,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:49,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:49,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -630395084, now seen corresponding path program 1 times [2025-03-04 01:10:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:49,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859938112] [2025-03-04 01:10:49,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:49,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:49,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:10:49,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:10:49,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:49,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:10:49,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135198592] [2025-03-04 01:10:49,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:49,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:49,887 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-04 01:10:49,888 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-04 01:10:49,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:10:50,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:10:50,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:50,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:50,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:10:50,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:50,264 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-04 01:10:50,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 17 treesize of output 17 [2025-03-04 01:10:50,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:50,398 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 34 treesize of output 12 [2025-03-04 01:10:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:50,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:50,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859938112] [2025-03-04 01:10:50,408 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:10:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135198592] [2025-03-04 01:10:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135198592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:50,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:50,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:10:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975039010] [2025-03-04 01:10:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:10:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:50,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:10:50,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:10:50,409 INFO L87 Difference]: Start difference. First operand 315 states and 432 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:50,679 INFO L93 Difference]: Finished difference Result 868 states and 1190 transitions. [2025-03-04 01:10:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:10:50,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-04 01:10:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:50,683 INFO L225 Difference]: With dead ends: 868 [2025-03-04 01:10:50,683 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 01:10:50,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:10:50,685 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 347 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:50,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 791 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:10:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 01:10:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 330. [2025-03-04 01:10:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 296 states have (on average 1.337837837837838) internal successors, (396), 297 states have internal predecessors, (396), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 452 transitions. [2025-03-04 01:10:50,708 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 452 transitions. Word has length 109 [2025-03-04 01:10:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:50,709 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 452 transitions. [2025-03-04 01:10:50,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 452 transitions. [2025-03-04 01:10:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:10:50,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:50,710 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:50,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 01:10:50,910 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,SelfDestructingSolverStorable12 [2025-03-04 01:10:50,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:50,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash -641711211, now seen corresponding path program 1 times [2025-03-04 01:10:50,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:50,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840033197] [2025-03-04 01:10:50,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:50,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:10:50,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:10:50,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:50,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:10:50,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596130427] [2025-03-04 01:10:50,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:50,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:50,966 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:10:50,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:10:51,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:10:51,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:10:51,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:51,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:51,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:10:51,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:51,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:51,179 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 19 treesize of output 9 [2025-03-04 01:10:51,212 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 19 treesize of output 7 [2025-03-04 01:10:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:51,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:51,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840033197] [2025-03-04 01:10:51,225 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:10:51,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596130427] [2025-03-04 01:10:51,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596130427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:51,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:51,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481742109] [2025-03-04 01:10:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:51,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:51,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:51,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:51,226 INFO L87 Difference]: Start difference. First operand 330 states and 452 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:51,302 INFO L93 Difference]: Finished difference Result 784 states and 1076 transitions. [2025-03-04 01:10:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-04 01:10:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:51,305 INFO L225 Difference]: With dead ends: 784 [2025-03-04 01:10:51,305 INFO L226 Difference]: Without dead ends: 523 [2025-03-04 01:10:51,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:10:51,306 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 116 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:51,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 641 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-04 01:10:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 330. [2025-03-04 01:10:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 296 states have (on average 1.337837837837838) internal successors, (396), 297 states have internal predecessors, (396), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 452 transitions. [2025-03-04 01:10:51,321 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 452 transitions. Word has length 109 [2025-03-04 01:10:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:51,322 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 452 transitions. [2025-03-04 01:10:51,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 452 transitions. [2025-03-04 01:10:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:10:51,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:51,322 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:51,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:10:51,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:51,523 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:51,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1915234360, now seen corresponding path program 1 times [2025-03-04 01:10:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:51,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760401469] [2025-03-04 01:10:51,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:51,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:10:51,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:10:51,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:51,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:10:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041323255] [2025-03-04 01:10:51,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:51,563 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:10:51,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:10:51,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:10:51,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:10:51,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:51,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:51,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 01:10:51,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:51,870 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 9 treesize of output 3 [2025-03-04 01:10:51,907 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-04 01:10:51,923 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-04 01:10:51,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 17 treesize of output 17 [2025-03-04 01:10:52,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:52,016 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 36 treesize of output 14 [2025-03-04 01:10:52,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 32 [2025-03-04 01:10:52,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:52,162 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 40 treesize of output 22 [2025-03-04 01:10:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:52,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:52,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760401469] [2025-03-04 01:10:52,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:10:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041323255] [2025-03-04 01:10:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041323255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:52,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:52,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:10:52,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133221173] [2025-03-04 01:10:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:10:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:52,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:10:52,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:10:52,238 INFO L87 Difference]: Start difference. First operand 330 states and 452 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:52,896 INFO L93 Difference]: Finished difference Result 826 states and 1133 transitions. [2025-03-04 01:10:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:10:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-04 01:10:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:52,900 INFO L225 Difference]: With dead ends: 826 [2025-03-04 01:10:52,901 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 01:10:52,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:10:52,904 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 236 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:52,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1342 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:10:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 01:10:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 330. [2025-03-04 01:10:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 296 states have (on average 1.337837837837838) internal successors, (396), 297 states have internal predecessors, (396), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 452 transitions. [2025-03-04 01:10:52,920 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 452 transitions. Word has length 109 [2025-03-04 01:10:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:52,921 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 452 transitions. [2025-03-04 01:10:52,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 452 transitions. [2025-03-04 01:10:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:10:52,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:52,922 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:52,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 01:10:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:53,122 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:53,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1896158932, now seen corresponding path program 1 times [2025-03-04 01:10:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142093940] [2025-03-04 01:10:53,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:53,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:10:53,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:10:53,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:53,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:53,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:53,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142093940] [2025-03-04 01:10:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142093940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:53,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:53,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:10:53,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930386888] [2025-03-04 01:10:53,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:53,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:10:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:53,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:10:53,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:10:53,180 INFO L87 Difference]: Start difference. First operand 330 states and 452 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:53,198 INFO L93 Difference]: Finished difference Result 586 states and 807 transitions. [2025-03-04 01:10:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:10:53,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:10:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:53,200 INFO L225 Difference]: With dead ends: 586 [2025-03-04 01:10:53,200 INFO L226 Difference]: Without dead ends: 326 [2025-03-04 01:10:53,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:10:53,200 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:53,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-04 01:10:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-04 01:10:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 292 states have (on average 1.3356164383561644) internal successors, (390), 293 states have internal predecessors, (390), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 446 transitions. [2025-03-04 01:10:53,217 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 446 transitions. Word has length 110 [2025-03-04 01:10:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:53,217 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 446 transitions. [2025-03-04 01:10:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 446 transitions. [2025-03-04 01:10:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:10:53,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:53,218 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:10:53,219 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:53,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1278971600, now seen corresponding path program 1 times [2025-03-04 01:10:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:53,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435194580] [2025-03-04 01:10:53,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:53,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:10:53,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:10:53,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:53,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435194580] [2025-03-04 01:10:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435194580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:53,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:53,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181495368] [2025-03-04 01:10:53,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:53,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:53,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:53,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:53,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:53,402 INFO L87 Difference]: Start difference. First operand 326 states and 446 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:53,451 INFO L93 Difference]: Finished difference Result 647 states and 891 transitions. [2025-03-04 01:10:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:53,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-03-04 01:10:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:53,455 INFO L225 Difference]: With dead ends: 647 [2025-03-04 01:10:53,455 INFO L226 Difference]: Without dead ends: 373 [2025-03-04 01:10:53,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:10:53,456 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 134 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:53,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 545 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-04 01:10:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 327. [2025-03-04 01:10:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 293 states have (on average 1.3276450511945392) internal successors, (389), 294 states have internal predecessors, (389), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 445 transitions. [2025-03-04 01:10:53,469 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 445 transitions. Word has length 110 [2025-03-04 01:10:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:53,469 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 445 transitions. [2025-03-04 01:10:53,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 445 transitions. [2025-03-04 01:10:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:10:53,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:53,470 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:53,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:10:53,470 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:53,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash 878861380, now seen corresponding path program 1 times [2025-03-04 01:10:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779190619] [2025-03-04 01:10:53,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:53,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:10:53,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:10:53,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:53,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779190619] [2025-03-04 01:10:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779190619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882015582] [2025-03-04 01:10:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:53,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:53,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:53,557 INFO L87 Difference]: Start difference. First operand 327 states and 445 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:53,655 INFO L93 Difference]: Finished difference Result 766 states and 1043 transitions. [2025-03-04 01:10:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:53,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:10:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:53,657 INFO L225 Difference]: With dead ends: 766 [2025-03-04 01:10:53,657 INFO L226 Difference]: Without dead ends: 499 [2025-03-04 01:10:53,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:53,658 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 110 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:53,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 730 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-04 01:10:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 365. [2025-03-04 01:10:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 331 states have (on average 1.3202416918429003) internal successors, (437), 332 states have internal predecessors, (437), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 493 transitions. [2025-03-04 01:10:53,677 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 493 transitions. Word has length 110 [2025-03-04 01:10:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:53,677 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 493 transitions. [2025-03-04 01:10:53,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 493 transitions. [2025-03-04 01:10:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:10:53,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:53,678 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:53,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:10:53,678 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:53,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1995859152, now seen corresponding path program 1 times [2025-03-04 01:10:53,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:53,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149108063] [2025-03-04 01:10:53,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:53,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:10:53,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:10:53,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:53,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:10:53,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968110950] [2025-03-04 01:10:53,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:53,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:53,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:53,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:10:53,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 01:10:53,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:10:53,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:10:53,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:53,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:53,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:10:53,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:53,968 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 9 treesize of output 3 [2025-03-04 01:10:54,000 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-04 01:10:54,015 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-04 01:10:54,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 17 treesize of output 17 [2025-03-04 01:10:54,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 [2025-03-04 01:10:54,231 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 33 treesize of output 25 [2025-03-04 01:10:54,233 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 29 treesize of output 21 [2025-03-04 01:10:54,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:54,268 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 42 treesize of output 20 [2025-03-04 01:10:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:54,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:54,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:54,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149108063] [2025-03-04 01:10:54,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:10:54,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968110950] [2025-03-04 01:10:54,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968110950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:54,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:54,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:10:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464598504] [2025-03-04 01:10:54,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:54,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:10:54,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:54,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:10:54,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:54,288 INFO L87 Difference]: Start difference. First operand 365 states and 493 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:55,046 INFO L93 Difference]: Finished difference Result 904 states and 1214 transitions. [2025-03-04 01:10:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:10:55,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:10:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:55,048 INFO L225 Difference]: With dead ends: 904 [2025-03-04 01:10:55,048 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 01:10:55,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:10:55,049 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 231 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:55,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1249 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:10:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 01:10:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 379. [2025-03-04 01:10:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 345 states have (on average 1.3246376811594203) internal successors, (457), 346 states have internal predecessors, (457), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 513 transitions. [2025-03-04 01:10:55,069 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 513 transitions. Word has length 110 [2025-03-04 01:10:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:55,069 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 513 transitions. [2025-03-04 01:10:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 513 transitions. [2025-03-04 01:10:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:10:55,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:55,070 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:55,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 01:10:55,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:55,271 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:55,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:55,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1777257840, now seen corresponding path program 1 times [2025-03-04 01:10:55,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:55,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532154235] [2025-03-04 01:10:55,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:55,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:10:55,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:10:55,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:55,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:10:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154170596] [2025-03-04 01:10:55,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:55,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:55,336 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:10:55,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:10:55,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:10:55,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:10:55,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:55,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:55,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:10:55,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:55,660 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 9 treesize of output 3 [2025-03-04 01:10:55,691 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-04 01:10:55,705 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-04 01:10:55,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 17 treesize of output 17 [2025-03-04 01:10:55,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 31 [2025-03-04 01:10:55,916 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 35 treesize of output 27 [2025-03-04 01:10:55,919 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 31 treesize of output 23 [2025-03-04 01:10:55,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:55,945 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 44 treesize of output 22 [2025-03-04 01:10:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:55,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:55,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:55,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532154235] [2025-03-04 01:10:55,963 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:10:55,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154170596] [2025-03-04 01:10:55,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154170596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:55,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:55,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:10:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967912247] [2025-03-04 01:10:55,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:55,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:10:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:55,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:10:55,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:55,964 INFO L87 Difference]: Start difference. First operand 379 states and 513 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:56,633 INFO L93 Difference]: Finished difference Result 896 states and 1205 transitions. [2025-03-04 01:10:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:10:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:10:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:56,636 INFO L225 Difference]: With dead ends: 896 [2025-03-04 01:10:56,636 INFO L226 Difference]: Without dead ends: 594 [2025-03-04 01:10:56,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:10:56,636 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 253 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:56,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1108 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:10:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-04 01:10:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 397. [2025-03-04 01:10:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 363 states have (on average 1.3195592286501376) internal successors, (479), 364 states have internal predecessors, (479), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 535 transitions. [2025-03-04 01:10:56,650 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 535 transitions. Word has length 110 [2025-03-04 01:10:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:56,650 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 535 transitions. [2025-03-04 01:10:56,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:10:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 535 transitions. [2025-03-04 01:10:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:10:56,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:56,651 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:56,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 01:10:56,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:56,852 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:56,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2007175279, now seen corresponding path program 1 times [2025-03-04 01:10:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:56,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709212357] [2025-03-04 01:10:56,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:56,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:10:56,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:10:56,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:56,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:10:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709212357] [2025-03-04 01:10:57,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709212357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:57,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:57,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:10:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780000634] [2025-03-04 01:10:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:10:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:57,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:10:57,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:57,205 INFO L87 Difference]: Start difference. First operand 397 states and 535 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:57,395 INFO L93 Difference]: Finished difference Result 787 states and 1061 transitions. [2025-03-04 01:10:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:10:57,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-03-04 01:10:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:57,397 INFO L225 Difference]: With dead ends: 787 [2025-03-04 01:10:57,397 INFO L226 Difference]: Without dead ends: 485 [2025-03-04 01:10:57,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:10:57,398 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 107 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:57,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1561 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:10:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-04 01:10:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 406. [2025-03-04 01:10:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 372 states have (on average 1.3198924731182795) internal successors, (491), 373 states have internal predecessors, (491), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:10:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 547 transitions. [2025-03-04 01:10:57,411 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 547 transitions. Word has length 110 [2025-03-04 01:10:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:57,411 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 547 transitions. [2025-03-04 01:10:57,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:10:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 547 transitions. [2025-03-04 01:10:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:10:57,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:57,412 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:10:57,412 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:57,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1973140453, now seen corresponding path program 1 times [2025-03-04 01:10:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933636496] [2025-03-04 01:10:57,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:57,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:10:57,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:10:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:10:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676911495] [2025-03-04 01:10:57,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:57,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:57,448 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:10:57,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 01:10:57,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:10:57,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:10:57,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:57,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:10:57,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:10:57,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:10:57,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:10:57,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:57,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:10:57,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:10:57,942 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:10:57,943 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:10:57,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 01:10:58,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 01:10:58,148 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:58,210 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:10:58,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:10:58 BoogieIcfgContainer [2025-03-04 01:10:58,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:10:58,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:10:58,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:10:58,215 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:10:58,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:40" (3/4) ... [2025-03-04 01:10:58,217 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:10:58,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:10:58,219 INFO L158 Benchmark]: Toolchain (without parser) took 19129.87ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 111.7MB in the beginning and 298.1MB in the end (delta: -186.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-04 01:10:58,219 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:10:58,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.72ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:10:58,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.20ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:10:58,220 INFO L158 Benchmark]: Boogie Preprocessor took 62.85ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 87.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:10:58,220 INFO L158 Benchmark]: IcfgBuilder took 605.74ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 50.5MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:10:58,220 INFO L158 Benchmark]: TraceAbstraction took 18135.30ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 49.5MB in the beginning and 298.2MB in the end (delta: -248.7MB). Peak memory consumption was 153.6MB. Max. memory is 16.1GB. [2025-03-04 01:10:58,220 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 352.3MB. Free memory was 298.2MB in the beginning and 298.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:10:58,221 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.72ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.20ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.85ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 87.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 605.74ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 50.5MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18135.30ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 49.5MB in the beginning and 298.2MB in the end (delta: -248.7MB). Peak memory consumption was 153.6MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 352.3MB. Free memory was 298.2MB in the beginning and 298.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -128 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -128 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 4 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 4 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L40] unsigned short int last_1_unsigned_short_int_Array_0_1_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] EXPR unsigned_short_int_Array_0[1] [L92] last_1_unsigned_short_int_Array_0_1_ = unsigned_short_int_Array_0[1] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] double_Array_0[1] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[1] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L77] EXPR double_Array_0[1] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] double_Array_0[3] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L81] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET updateVariables() [L104] CALL step() [L44] signed_short_int_Array_0[0] = 200 [L45] EXPR signed_char_Array_0[0] [L45] signed_char_Array_0[1] = signed_char_Array_0[0] [L46] EXPR double_Array_0[1] [L46] double_Array_0[4] = double_Array_0[1] [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR unsigned_char_Array_0[0] [L47] signed long int stepLocal_0 = unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]; [L48] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L51] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) [L51] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=0, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] COND TRUE stepLocal_0 >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)))) [L52] EXPR unsigned_char_Array_0[0] [L52] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[1] [L57] signed long int stepLocal_2 = unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1]; [L58] EXPR signed_short_int_Array_0[0] [L58] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] EXPR signed_short_int_Array_0[0] ^ signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=62, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] signed long int stepLocal_1 = signed_short_int_Array_0[0] ^ signed_char_Array_0[1]; [L59] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND FALSE !(signed_char_Array_0[1] <= stepLocal_2) [L66] EXPR double_Array_0[1] [L66] double_Array_0[2] = double_Array_0[1] [L68] EXPR signed_char_Array_0[1] [L68] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] COND FALSE !(signed_char_Array_0[1] > signed_char_Array_0[1]) [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR unsigned_char_Array_0[0] [L95] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) [L95] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L95] EXPR unsigned_short_int_Array_0[1] [L95] EXPR unsigned_char_Array_0[0] [L95] EXPR ((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) [L95] EXPR signed_char_Array_0[1] [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])) [L95] EXPR double_Array_0[2] [L95] EXPR double_Array_0[1] [L95] EXPR (signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95-L96] return (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3120 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3109 mSDsluCounter, 16819 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13105 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4119 IncrementalHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 3714 mSDtfsCounter, 4119 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1170 GetRequests, 1001 SyntacticMatches, 2 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=21, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 2353 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 3471 NumberOfCodeBlocks, 3471 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2463 ConstructedInterpolants, 0 QuantifiedInterpolants, 8089 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3691 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 5031/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:10:58,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-a_file-83.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 f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:10:59,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:11:00,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:11:00,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:11:00,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:11:00,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:11:00,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:11:00,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:11:00,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:11:00,093 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:11:00,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:11:00,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:11:00,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:11:00,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:11:00,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:11:00,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:11:00,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:11:00,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:11:00,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:11:00,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:11:00,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:11:00,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:11:00,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:11:00,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:11:00,097 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 -> f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 [2025-03-04 01:11:00,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:11:00,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:11:00,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:11:00,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:11:00,335 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:11:00,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2025-03-04 01:11:01,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256a11cde/9b04f3ccf8654d34b753df07643af6d2/FLAG952101f20 [2025-03-04 01:11:01,667 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:11:01,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2025-03-04 01:11:01,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256a11cde/9b04f3ccf8654d34b753df07643af6d2/FLAG952101f20 [2025-03-04 01:11:02,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256a11cde/9b04f3ccf8654d34b753df07643af6d2 [2025-03-04 01:11:02,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:11:02,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:11:02,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:11:02,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:11:02,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:11:02,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab4b8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02, skipping insertion in model container [2025-03-04 01:11:02,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:11:02,164 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-a_file-83.i[916,929] [2025-03-04 01:11:02,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:11:02,211 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:11:02,218 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-a_file-83.i[916,929] [2025-03-04 01:11:02,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:11:02,262 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:11:02,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02 WrapperNode [2025-03-04 01:11:02,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:11:02,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:11:02,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:11:02,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:11:02,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,318 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2025-03-04 01:11:02,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:11:02,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:11:02,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:11:02,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:11:02,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,350 INFO L175 MemorySlicer]: Split 130 memory accesses to 7 slices as follows [2, 6, 47, 21, 5, 9, 40]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 1, 1, 2]. The 16 writes are split as follows [0, 1, 7, 2, 1, 1, 4]. [2025-03-04 01:11:02,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:11:02,388 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:11:02,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:11:02,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:11:02,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (1/1) ... [2025-03-04 01:11:02,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:11:02,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:02,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:11:02,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-04 01:11:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:11:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:11:02,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:11:02,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:11:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:11:02,555 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:11:02,556 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:11:03,353 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem77#1;havoc property_#t~ite102#1;havoc property_#t~mem91#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite90#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite120#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite117#1;havoc property_#t~mem114#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-04 01:11:03,384 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-04 01:11:03,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:11:03,391 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:11:03,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:11:03,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:11:03 BoogieIcfgContainer [2025-03-04 01:11:03,392 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:11:03,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:11:03,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:11:03,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:11:03,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:11:02" (1/3) ... [2025-03-04 01:11:03,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46083236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:11:03, skipping insertion in model container [2025-03-04 01:11:03,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:02" (2/3) ... [2025-03-04 01:11:03,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46083236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:11:03, skipping insertion in model container [2025-03-04 01:11:03,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:11:03" (3/3) ... [2025-03-04 01:11:03,399 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-83.i [2025-03-04 01:11:03,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:11:03,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-83.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:11:03,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:11:03,450 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;@e0b566, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:11:03,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:11:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:11:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:03,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:03,462 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:03,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:03,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 11972660, now seen corresponding path program 1 times [2025-03-04 01:11:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094537913] [2025-03-04 01:11:03,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:03,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:03,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:03,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:03,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:11:03,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:03,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:03,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:03,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:03,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:11:03,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:11:03,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:03,788 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094537913] [2025-03-04 01:11:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094537913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:11:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357868274] [2025-03-04 01:11:03,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:03,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:11:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:03,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:11:03,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:11:03,806 INFO L87 Difference]: Start difference. First operand has 102 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:11:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:03,821 INFO L93 Difference]: Finished difference Result 198 states and 304 transitions. [2025-03-04 01:11:03,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:11:03,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2025-03-04 01:11:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:03,826 INFO L225 Difference]: With dead ends: 198 [2025-03-04 01:11:03,826 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 01:11:03,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:11:03,829 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:03,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 01:11:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 01:11:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:11:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2025-03-04 01:11:03,869 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 104 [2025-03-04 01:11:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:03,870 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2025-03-04 01:11:03,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:11:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2025-03-04 01:11:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:03,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:03,872 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:03,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:11:04,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:04,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:04,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:04,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1187195875, now seen corresponding path program 1 times [2025-03-04 01:11:04,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:04,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098680201] [2025-03-04 01:11:04,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:04,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:04,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:04,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:04,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:11:04,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:04,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:04,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:04,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:04,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:11:04,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:04,404 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 21 treesize of output 9 [2025-03-04 01:11:04,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:04,592 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 19 treesize of output 9 [2025-03-04 01:11:04,599 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 31 treesize of output 19 [2025-03-04 01:11:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:04,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:04,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098680201] [2025-03-04 01:11:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098680201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:04,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:04,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666449276] [2025-03-04 01:11:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:04,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:04,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:04,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:04,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:04,647 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:05,287 INFO L93 Difference]: Finished difference Result 379 states and 532 transitions. [2025-03-04 01:11:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:11:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:11:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:05,291 INFO L225 Difference]: With dead ends: 379 [2025-03-04 01:11:05,292 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 01:11:05,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:11:05,294 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 262 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:05,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1063 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:11:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 01:11:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 143. [2025-03-04 01:11:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 118 states have internal predecessors, (157), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:11:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2025-03-04 01:11:05,308 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 104 [2025-03-04 01:11:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:05,308 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2025-03-04 01:11:05,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2025-03-04 01:11:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:05,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:05,310 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:05,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:11:05,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:05,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:05,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1030562078, now seen corresponding path program 1 times [2025-03-04 01:11:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849217110] [2025-03-04 01:11:05,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:05,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:05,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:05,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:11:05,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:05,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:05,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:05,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:05,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:11:05,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:05,803 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 21 treesize of output 9 [2025-03-04 01:11:05,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:05,927 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 19 treesize of output 9 [2025-03-04 01:11:06,010 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 29 treesize of output 17 [2025-03-04 01:11:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:06,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:06,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:06,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849217110] [2025-03-04 01:11:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849217110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:06,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437884470] [2025-03-04 01:11:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:06,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:06,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:06,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:06,094 INFO L87 Difference]: Start difference. First operand 143 states and 201 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:07,298 INFO L93 Difference]: Finished difference Result 338 states and 472 transitions. [2025-03-04 01:11:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:11:07,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:11:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:07,301 INFO L225 Difference]: With dead ends: 338 [2025-03-04 01:11:07,301 INFO L226 Difference]: Without dead ends: 242 [2025-03-04 01:11:07,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:11:07,302 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 269 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:07,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 571 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:11:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-04 01:11:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 160. [2025-03-04 01:11:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 135 states have internal predecessors, (180), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:11:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 224 transitions. [2025-03-04 01:11:07,326 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 224 transitions. Word has length 104 [2025-03-04 01:11:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:07,328 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 224 transitions. [2025-03-04 01:11:07,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2025-03-04 01:11:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:07,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:07,329 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:07,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:11:07,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:07,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:07,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1911095521, now seen corresponding path program 1 times [2025-03-04 01:11:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:07,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072117517] [2025-03-04 01:11:07,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:07,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:07,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:07,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:07,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:11:07,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:07,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:07,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:07,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:07,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:11:07,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:07,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:07,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:07,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072117517] [2025-03-04 01:11:07,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072117517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:07,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:07,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221795821] [2025-03-04 01:11:07,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:07,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:07,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:07,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:07,791 INFO L87 Difference]: Start difference. First operand 160 states and 224 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:07,825 INFO L93 Difference]: Finished difference Result 261 states and 366 transitions. [2025-03-04 01:11:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:11:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:07,826 INFO L225 Difference]: With dead ends: 261 [2025-03-04 01:11:07,827 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 01:11:07,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:07,828 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:07,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 01:11:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2025-03-04 01:11:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:11:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 228 transitions. [2025-03-04 01:11:07,844 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 228 transitions. Word has length 104 [2025-03-04 01:11:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:07,844 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 228 transitions. [2025-03-04 01:11:07,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2025-03-04 01:11:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:07,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:07,848 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:07,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:11:08,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:08,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:08,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 576417312, now seen corresponding path program 1 times [2025-03-04 01:11:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:08,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430895786] [2025-03-04 01:11:08,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:08,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:08,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:08,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:08,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:11:08,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:08,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:08,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:08,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:08,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:11:08,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:08,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:08,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430895786] [2025-03-04 01:11:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430895786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:08,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501499863] [2025-03-04 01:11:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:08,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:08,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:08,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:08,379 INFO L87 Difference]: Start difference. First operand 164 states and 228 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:08,423 INFO L93 Difference]: Finished difference Result 267 states and 371 transitions. [2025-03-04 01:11:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:08,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:11:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:08,426 INFO L225 Difference]: With dead ends: 267 [2025-03-04 01:11:08,426 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 01:11:08,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:08,427 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:08,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 01:11:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2025-03-04 01:11:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 141 states have internal predecessors, (186), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:11:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2025-03-04 01:11:08,435 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 104 [2025-03-04 01:11:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:08,435 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2025-03-04 01:11:08,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2025-03-04 01:11:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:08,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:08,439 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:08,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:11:08,640 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-04 01:11:08,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:08,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1463920993, now seen corresponding path program 1 times [2025-03-04 01:11:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:08,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256934974] [2025-03-04 01:11:08,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:08,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:08,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:08,643 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-04 01:11:08,645 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-04 01:11:08,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:08,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:08,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:08,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:08,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:11:08,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:08,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:08,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:08,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256934974] [2025-03-04 01:11:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256934974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:11:08,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368559582] [2025-03-04 01:11:08,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:08,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:08,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:08,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:08,903 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:08,956 INFO L93 Difference]: Finished difference Result 271 states and 375 transitions. [2025-03-04 01:11:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:08,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:11:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:08,959 INFO L225 Difference]: With dead ends: 271 [2025-03-04 01:11:08,959 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 01:11:08,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:08,961 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:08,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 01:11:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2025-03-04 01:11:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3146853146853146) internal successors, (188), 143 states have internal predecessors, (188), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:11:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 232 transitions. [2025-03-04 01:11:08,971 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 232 transitions. Word has length 104 [2025-03-04 01:11:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:08,972 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 232 transitions. [2025-03-04 01:11:08,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 232 transitions. [2025-03-04 01:11:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:08,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:08,973 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:08,982 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-04 01:11:09,173 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-04 01:11:09,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1464844514, now seen corresponding path program 1 times [2025-03-04 01:11:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952585232] [2025-03-04 01:11:09,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:09,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:09,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:09,176 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:09,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:11:09,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:09,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:09,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:09,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:09,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:11:09,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:09,417 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 20 treesize of output 16 [2025-03-04 01:11:09,534 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 63 treesize of output 51 [2025-03-04 01:11:09,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:09,540 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 72 treesize of output 44 [2025-03-04 01:11:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:09,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:09,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952585232] [2025-03-04 01:11:09,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952585232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:09,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:09,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:11:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718389443] [2025-03-04 01:11:09,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:09,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:11:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:09,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:11:09,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:09,578 INFO L87 Difference]: Start difference. First operand 168 states and 232 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:10,058 INFO L93 Difference]: Finished difference Result 450 states and 616 transitions. [2025-03-04 01:11:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:11:10,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:11:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:10,060 INFO L225 Difference]: With dead ends: 450 [2025-03-04 01:11:10,060 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 01:11:10,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:11:10,061 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 199 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:10,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 987 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:11:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 01:11:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 262. [2025-03-04 01:11:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 230 states have (on average 1.326086956521739) internal successors, (305), 231 states have internal predecessors, (305), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:11:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 361 transitions. [2025-03-04 01:11:10,073 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 361 transitions. Word has length 104 [2025-03-04 01:11:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:10,073 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 361 transitions. [2025-03-04 01:11:10,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2025-03-04 01:11:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:10,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:10,074 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:10,083 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:10,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:10,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:10,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:10,275 INFO L85 PathProgramCache]: Analyzing trace with hash 954310337, now seen corresponding path program 1 times [2025-03-04 01:11:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:10,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585605710] [2025-03-04 01:11:10,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:10,277 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:10,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:11:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:10,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:10,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:10,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:10,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:11:10,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:10,551 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 19 treesize of output 11 [2025-03-04 01:11:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:11:10,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:10,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585605710] [2025-03-04 01:11:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585605710] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:10,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:10,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 01:11:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592786546] [2025-03-04 01:11:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:10,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:11:10,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:10,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:11:10,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:10,762 INFO L87 Difference]: Start difference. First operand 262 states and 361 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:10,864 INFO L93 Difference]: Finished difference Result 451 states and 622 transitions. [2025-03-04 01:11:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:11:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:11:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:10,868 INFO L225 Difference]: With dead ends: 451 [2025-03-04 01:11:10,868 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:11:10,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:10,869 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:10,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:11:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-04 01:11:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 232 states have (on average 1.3232758620689655) internal successors, (307), 233 states have internal predecessors, (307), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:11:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2025-03-04 01:11:10,889 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 104 [2025-03-04 01:11:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:10,889 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2025-03-04 01:11:10,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2025-03-04 01:11:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:11:10,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:10,890 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:10,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:11:11,090 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-04 01:11:11,090 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:11,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:11,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1397837761, now seen corresponding path program 1 times [2025-03-04 01:11:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:11,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123431017] [2025-03-04 01:11:11,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:11,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:11,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:11,093 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-04 01:11:11,093 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-04 01:11:11,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:11:11,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:11:11,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:11,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:11,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:11:11,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:11,373 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 17 treesize of output 13 [2025-03-04 01:11:11,376 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 24 treesize of output 16 [2025-03-04 01:11:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:11:11,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:11,693 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 19 treesize of output 15 [2025-03-04 01:11:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:11,733 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:11,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123431017] [2025-03-04 01:11:11,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123431017] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:11,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:11,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-03-04 01:11:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613307276] [2025-03-04 01:11:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:11,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:11,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:11,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:11:11,734 INFO L87 Difference]: Start difference. First operand 264 states and 363 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:11,805 INFO L93 Difference]: Finished difference Result 473 states and 652 transitions. [2025-03-04 01:11:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:11,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:11:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:11,806 INFO L225 Difference]: With dead ends: 473 [2025-03-04 01:11:11,806 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 01:11:11,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:11,807 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 25 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:11,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 01:11:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 265. [2025-03-04 01:11:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 233 states have (on average 1.3175965665236051) internal successors, (307), 234 states have internal predecessors, (307), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:11:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 363 transitions. [2025-03-04 01:11:11,816 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 363 transitions. Word has length 104 [2025-03-04 01:11:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:11,816 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 363 transitions. [2025-03-04 01:11:11,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 363 transitions. [2025-03-04 01:11:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:11:11,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:11,817 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:11,826 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-04 01:11:12,021 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-04 01:11:12,021 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:12,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1048771106, now seen corresponding path program 1 times [2025-03-04 01:11:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760035052] [2025-03-04 01:11:12,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:12,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:12,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:12,023 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:12,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:11:12,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:11:12,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:11:12,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:12,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:12,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:11:12,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:12,273 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 21 treesize of output 9 [2025-03-04 01:11:12,583 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 19 treesize of output 11 [2025-03-04 01:11:12,638 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 37 treesize of output 25 [2025-03-04 01:11:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:11:12,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:14,142 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 41 treesize of output 29 [2025-03-04 01:11:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:14,187 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760035052] [2025-03-04 01:11:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760035052] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2025-03-04 01:11:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828624777] [2025-03-04 01:11:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:14,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:14,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:14,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:11:14,188 INFO L87 Difference]: Start difference. First operand 265 states and 363 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:17,142 INFO L93 Difference]: Finished difference Result 569 states and 776 transitions. [2025-03-04 01:11:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:17,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-03-04 01:11:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:17,148 INFO L225 Difference]: With dead ends: 569 [2025-03-04 01:11:17,149 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 01:11:17,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:11:17,150 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 62 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:17,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 704 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 01:11:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 01:11:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 289. [2025-03-04 01:11:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 257 states have (on average 1.3424124513618676) internal successors, (345), 258 states have internal predecessors, (345), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:11:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 401 transitions. [2025-03-04 01:11:17,163 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 401 transitions. Word has length 105 [2025-03-04 01:11:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:17,163 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 401 transitions. [2025-03-04 01:11:17,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 401 transitions. [2025-03-04 01:11:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:11:17,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:17,164 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:17,173 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-04 01:11:17,364 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-04 01:11:17,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:17,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1679521024, now seen corresponding path program 1 times [2025-03-04 01:11:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367907348] [2025-03-04 01:11:17,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:17,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:17,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:17,367 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-04 01:11:17,368 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-04 01:11:17,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:11:17,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:11:17,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:17,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:17,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:11:17,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:17,600 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 21 treesize of output 9 [2025-03-04 01:11:17,782 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 17 treesize of output 13 [2025-03-04 01:11:17,785 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 24 treesize of output 16 [2025-03-04 01:11:18,048 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 37 treesize of output 25 [2025-03-04 01:11:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:11:18,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:18,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 32 treesize of output 20 [2025-03-04 01:11:18,491 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 22 treesize of output 18 [2025-03-04 01:11:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:18,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:18,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367907348] [2025-03-04 01:11:18,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367907348] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:18,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:18,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-04 01:11:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230460331] [2025-03-04 01:11:18,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:18,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:18,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:18,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:18,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:11:18,556 INFO L87 Difference]: Start difference. First operand 289 states and 401 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:19,225 INFO L93 Difference]: Finished difference Result 491 states and 680 transitions. [2025-03-04 01:11:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-03-04 01:11:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:19,228 INFO L225 Difference]: With dead ends: 491 [2025-03-04 01:11:19,228 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 01:11:19,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:11:19,229 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 26 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:19,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 543 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:11:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 01:11:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-04 01:11:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 243 states have (on average 1.3251028806584362) internal successors, (322), 244 states have internal predecessors, (322), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:11:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 378 transitions. [2025-03-04 01:11:19,237 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 378 transitions. Word has length 105 [2025-03-04 01:11:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:19,238 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 378 transitions. [2025-03-04 01:11:19,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 378 transitions. [2025-03-04 01:11:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:11:19,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:19,243 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:19,254 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-04 01:11:19,444 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-04 01:11:19,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:19,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1017751299, now seen corresponding path program 1 times [2025-03-04 01:11:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:19,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727093204] [2025-03-04 01:11:19,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:19,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:19,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:19,448 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-04 01:11:19,450 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-04 01:11:19,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:11:19,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:11:19,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:19,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:19,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:11:19,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:19,698 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 21 treesize of output 9 [2025-03-04 01:11:19,876 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 16 [2025-03-04 01:11:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:11:19,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:19,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727093204] [2025-03-04 01:11:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727093204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:19,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831219723] [2025-03-04 01:11:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:19,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:19,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:19,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:19,914 INFO L87 Difference]: Start difference. First operand 275 states and 378 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:21,099 INFO L93 Difference]: Finished difference Result 642 states and 874 transitions. [2025-03-04 01:11:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:11:21,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-03-04 01:11:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:21,102 INFO L225 Difference]: With dead ends: 642 [2025-03-04 01:11:21,102 INFO L226 Difference]: Without dead ends: 440 [2025-03-04 01:11:21,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:21,103 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 275 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:21,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 602 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:11:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-04 01:11:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 278. [2025-03-04 01:11:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 246 states have (on average 1.329268292682927) internal successors, (327), 247 states have internal predecessors, (327), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:11:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 383 transitions. [2025-03-04 01:11:21,117 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 383 transitions. Word has length 105 [2025-03-04 01:11:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:21,118 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 383 transitions. [2025-03-04 01:11:21,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:11:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 383 transitions. [2025-03-04 01:11:21,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:11:21,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:21,119 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:21,133 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 (13)] Ended with exit code 0 [2025-03-04 01:11:21,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:21,324 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:21,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:21,324 INFO L85 PathProgramCache]: Analyzing trace with hash 755633529, now seen corresponding path program 1 times [2025-03-04 01:11:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604010589] [2025-03-04 01:11:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:21,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:21,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:21,327 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:11:21,328 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 (14)] Waiting until timeout for monitored process [2025-03-04 01:11:21,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:11:21,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:11:21,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:21,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:21,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:11:21,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:21,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2025-03-04 01:11:22,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:22,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 153 treesize of output 87 [2025-03-04 01:11:26,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:26,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 109 [2025-03-04 01:11:31,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:31,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 107 [2025-03-04 01:11:32,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:32,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 321 treesize of output 117 [2025-03-04 01:11:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 32 proven. 72 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:11:32,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:32,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604010589] [2025-03-04 01:11:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604010589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1360745306] [2025-03-04 01:11:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:32,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:11:32,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:11:32,867 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:11:32,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-03-04 01:11:33,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:11:33,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:11:33,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:33,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:33,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:11:33,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:34,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:11:42,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:42,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 79 [2025-03-04 01:11:51,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:51,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 99 [2025-03-04 01:11:58,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:58,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 93 [2025-03-04 01:11:59,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:59,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 253 treesize of output 117 [2025-03-04 01:11:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 32 proven. 72 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:11:59,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1360745306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:59,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:11:59,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2025-03-04 01:11:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739278353] [2025-03-04 01:11:59,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:11:59,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:11:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:59,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:11:59,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=453, Unknown=9, NotChecked=0, Total=552 [2025-03-04 01:11:59,416 INFO L87 Difference]: Start difference. First operand 278 states and 383 transitions. Second operand has 21 states, 21 states have (on average 5.095238095238095) internal successors, (107), 20 states have internal predecessors, (107), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 01:12:03,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:12:07,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]