./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.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 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:23:13,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:23:13,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:23:13,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:23:13,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:23:13,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:23:13,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:23:13,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:23:13,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:23:13,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:23:13,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:23:13,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:23:13,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:23:13,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:23:13,637 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:23:13,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:23:13,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:23:13,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:23:13,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:23:13,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:23:13,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:23:13,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:23:13,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:23:13,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:23:13,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:23:13,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:23:13,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:23:13,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:23:13,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:23:13,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:23:13,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:23:13,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:23:13,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:23:13,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:23:13,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:23:13,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:23:13,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:23:13,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:23:13,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:23:13,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:23:13,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:23:13,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:23:13,664 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 [2024-10-13 06:23:14,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:23:14,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:23:14,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:23:14,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:23:14,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:23:14,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2024-10-13 06:23:15,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:23:16,073 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:23:16,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2024-10-13 06:23:16,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb18741a/81246bfe08f045d29aaeeb27de3c246d/FLAGde6ca2891 [2024-10-13 06:23:16,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb18741a/81246bfe08f045d29aaeeb27de3c246d [2024-10-13 06:23:16,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:23:16,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:23:16,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:23:16,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:23:16,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:23:16,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a307ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16, skipping insertion in model container [2024-10-13 06:23:16,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:23:16,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i[916,929] [2024-10-13 06:23:16,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:23:16,473 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:23:16,485 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i[916,929] [2024-10-13 06:23:16,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:23:16,562 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:23:16,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16 WrapperNode [2024-10-13 06:23:16,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:23:16,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:23:16,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:23:16,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:23:16,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,644 INFO L138 Inliner]: procedures = 29, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 565 [2024-10-13 06:23:16,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:23:16,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:23:16,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:23:16,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:23:16,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,724 INFO L175 MemorySlicer]: Split 134 memory accesses to 17 slices as follows [2, 9, 10, 6, 16, 17, 12, 6, 8, 10, 10, 3, 4, 3, 8, 4, 6]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-13 06:23:16,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:23:16,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:23:16,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:23:16,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:23:16,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (1/1) ... [2024-10-13 06:23:16,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:23:16,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:23:16,814 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) [2024-10-13 06:23:16,818 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 [2024-10-13 06:23:16,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:23:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:23:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:23:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:23:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:23:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:23:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:23:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 06:23:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 06:23:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-13 06:23:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-13 06:23:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-13 06:23:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-13 06:23:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-13 06:23:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-13 06:23:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-13 06:23:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-13 06:23:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-10-13 06:23:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:23:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:23:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:23:16,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:23:16,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:23:16,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:23:16,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:23:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:23:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:23:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:23:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 06:23:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 06:23:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 06:23:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-13 06:23:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-13 06:23:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-13 06:23:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-13 06:23:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:23:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:23:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-13 06:23:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-13 06:23:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-13 06:23:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-13 06:23:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-10-13 06:23:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:23:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:23:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:23:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:23:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:23:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:23:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:23:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-13 06:23:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-13 06:23:16,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-10-13 06:23:16,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:23:16,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:23:16,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:23:16,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:23:16,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:23:16,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:23:16,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:23:16,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:23:16,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:23:16,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:23:16,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:23:16,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:23:16,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 06:23:16,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 06:23:16,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 06:23:16,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-13 06:23:16,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-13 06:23:16,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-13 06:23:16,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-13 06:23:16,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:23:16,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:23:17,165 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:23:17,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:23:17,640 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-13 06:23:17,640 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:23:17,685 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:23:17,685 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:23:17,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:23:17 BoogieIcfgContainer [2024-10-13 06:23:17,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:23:17,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:23:17,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:23:17,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:23:17,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:23:16" (1/3) ... [2024-10-13 06:23:17,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20940f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:23:17, skipping insertion in model container [2024-10-13 06:23:17,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:16" (2/3) ... [2024-10-13 06:23:17,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20940f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:23:17, skipping insertion in model container [2024-10-13 06:23:17,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:23:17" (3/3) ... [2024-10-13 06:23:17,695 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-88.i [2024-10-13 06:23:17,711 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:23:17,711 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:23:17,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:23:17,795 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;@5b262640, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:23:17,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:23:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:23:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:23:17,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:17,816 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:17,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:17,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash 224498974, now seen corresponding path program 1 times [2024-10-13 06:23:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46151242] [2024-10-13 06:23:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:18,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:18,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46151242] [2024-10-13 06:23:18,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46151242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:18,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:18,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:23:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687375276] [2024-10-13 06:23:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:18,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:23:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:18,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:23:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:23:18,566 INFO L87 Difference]: Start difference. First operand has 112 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:23:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:18,623 INFO L93 Difference]: Finished difference Result 221 states and 351 transitions. [2024-10-13 06:23:18,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:23:18,630 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-10-13 06:23:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:18,637 INFO L225 Difference]: With dead ends: 221 [2024-10-13 06:23:18,638 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 06:23:18,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:23:18,644 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:18,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 06:23:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-13 06:23:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:23:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2024-10-13 06:23:18,693 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 138 [2024-10-13 06:23:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2024-10-13 06:23:18,694 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:23:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2024-10-13 06:23:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:23:18,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:18,699 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:18,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:23:18,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:18,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash 238794760, now seen corresponding path program 1 times [2024-10-13 06:23:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:18,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996568184] [2024-10-13 06:23:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996568184] [2024-10-13 06:23:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996568184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:23:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101170199] [2024-10-13 06:23:19,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:19,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:23:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:19,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:23:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:19,218 INFO L87 Difference]: Start difference. First operand 110 states and 163 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:19,309 INFO L93 Difference]: Finished difference Result 222 states and 329 transitions. [2024-10-13 06:23:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:23:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-13 06:23:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:19,314 INFO L225 Difference]: With dead ends: 222 [2024-10-13 06:23:19,314 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 06:23:19,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:19,316 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:19,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 06:23:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-13 06:23:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:23:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2024-10-13 06:23:19,336 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 138 [2024-10-13 06:23:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:19,337 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2024-10-13 06:23:19,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2024-10-13 06:23:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:23:19,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:19,342 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:19,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:23:19,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:19,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash -570551866, now seen corresponding path program 1 times [2024-10-13 06:23:19,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:19,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550143739] [2024-10-13 06:23:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550143739] [2024-10-13 06:23:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550143739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:23:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511150847] [2024-10-13 06:23:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:19,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:23:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:23:19,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:19,563 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:19,598 INFO L93 Difference]: Finished difference Result 226 states and 333 transitions. [2024-10-13 06:23:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:23:19,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-13 06:23:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:19,601 INFO L225 Difference]: With dead ends: 226 [2024-10-13 06:23:19,601 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 06:23:19,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:19,603 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:19,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 462 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 06:23:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-13 06:23:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:23:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 167 transitions. [2024-10-13 06:23:19,612 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 167 transitions. Word has length 138 [2024-10-13 06:23:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:19,613 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 167 transitions. [2024-10-13 06:23:19,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 167 transitions. [2024-10-13 06:23:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:23:19,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:19,615 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:19,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:23:19,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:19,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:19,616 INFO L85 PathProgramCache]: Analyzing trace with hash -513293564, now seen corresponding path program 1 times [2024-10-13 06:23:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:19,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300941715] [2024-10-13 06:23:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:19,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:19,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:19,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300941715] [2024-10-13 06:23:19,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300941715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:19,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:19,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:23:19,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329498006] [2024-10-13 06:23:19,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:19,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:23:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:19,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:23:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:19,851 INFO L87 Difference]: Start difference. First operand 114 states and 167 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:19,883 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2024-10-13 06:23:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:23:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-13 06:23:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:19,885 INFO L225 Difference]: With dead ends: 230 [2024-10-13 06:23:19,886 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 06:23:19,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:19,888 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:19,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 06:23:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-10-13 06:23:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:23:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2024-10-13 06:23:19,897 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 138 [2024-10-13 06:23:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:19,898 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2024-10-13 06:23:19,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2024-10-13 06:23:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:23:19,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:19,900 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:19,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:23:19,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:19,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:19,901 INFO L85 PathProgramCache]: Analyzing trace with hash -513233982, now seen corresponding path program 1 times [2024-10-13 06:23:19,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:19,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170715526] [2024-10-13 06:23:19,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:19,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170715526] [2024-10-13 06:23:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170715526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:20,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:20,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:23:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014123840] [2024-10-13 06:23:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:20,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:20,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:20,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:20,393 INFO L87 Difference]: Start difference. First operand 116 states and 169 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:20,499 INFO L93 Difference]: Finished difference Result 246 states and 356 transitions. [2024-10-13 06:23:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:20,500 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-13 06:23:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:20,502 INFO L225 Difference]: With dead ends: 246 [2024-10-13 06:23:20,504 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 06:23:20,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:23:20,506 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 91 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:20,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 544 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 06:23:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-10-13 06:23:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 107 states have internal predecessors, (144), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:23:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2024-10-13 06:23:20,528 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 138 [2024-10-13 06:23:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:20,532 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2024-10-13 06:23:20,532 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2024-10-13 06:23:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:23:20,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:20,534 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:20,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:23:20,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:20,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1745951856, now seen corresponding path program 1 times [2024-10-13 06:23:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:20,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342711906] [2024-10-13 06:23:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:20,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:20,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:20,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342711906] [2024-10-13 06:23:20,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342711906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:20,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:20,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:23:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550433541] [2024-10-13 06:23:20,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:20,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:20,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:20,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:20,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:20,894 INFO L87 Difference]: Start difference. First operand 130 states and 186 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:20,942 INFO L93 Difference]: Finished difference Result 254 states and 363 transitions. [2024-10-13 06:23:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:20,943 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-10-13 06:23:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:20,947 INFO L225 Difference]: With dead ends: 254 [2024-10-13 06:23:20,949 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 06:23:20,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:20,951 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:20,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 06:23:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-13 06:23:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 109 states have (on average 1.348623853211009) internal successors, (147), 110 states have internal predecessors, (147), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:23:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 189 transitions. [2024-10-13 06:23:20,970 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 189 transitions. Word has length 140 [2024-10-13 06:23:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:20,970 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 189 transitions. [2024-10-13 06:23:20,971 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 189 transitions. [2024-10-13 06:23:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:23:20,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:20,973 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:20,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:23:20,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:20,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash 299348058, now seen corresponding path program 1 times [2024-10-13 06:23:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673519999] [2024-10-13 06:23:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673519999] [2024-10-13 06:23:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673519999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:21,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:23:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853941090] [2024-10-13 06:23:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:21,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:23:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:23:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:21,366 INFO L87 Difference]: Start difference. First operand 133 states and 189 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:21,459 INFO L93 Difference]: Finished difference Result 258 states and 366 transitions. [2024-10-13 06:23:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:23:21,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-13 06:23:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:21,461 INFO L225 Difference]: With dead ends: 258 [2024-10-13 06:23:21,461 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 06:23:21,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:23:21,462 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 86 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:21,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 697 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 06:23:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2024-10-13 06:23:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 108 states have internal predecessors, (144), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:23:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 186 transitions. [2024-10-13 06:23:21,469 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 186 transitions. Word has length 141 [2024-10-13 06:23:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:21,470 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 186 transitions. [2024-10-13 06:23:21,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 186 transitions. [2024-10-13 06:23:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:23:21,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:21,472 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:21,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:23:21,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:21,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1218817099, now seen corresponding path program 1 times [2024-10-13 06:23:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667637550] [2024-10-13 06:23:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:21,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667637550] [2024-10-13 06:23:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667637550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:21,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:21,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:23:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600603285] [2024-10-13 06:23:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:21,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:23:21,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:21,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:23:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:21,983 INFO L87 Difference]: Start difference. First operand 131 states and 186 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:22,142 INFO L93 Difference]: Finished difference Result 364 states and 518 transitions. [2024-10-13 06:23:22,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:23:22,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2024-10-13 06:23:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:22,144 INFO L225 Difference]: With dead ends: 364 [2024-10-13 06:23:22,144 INFO L226 Difference]: Without dead ends: 242 [2024-10-13 06:23:22,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:22,147 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 155 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:22,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 448 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-13 06:23:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 193. [2024-10-13 06:23:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 155 states have (on average 1.335483870967742) internal successors, (207), 155 states have internal predecessors, (207), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2024-10-13 06:23:22,175 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 142 [2024-10-13 06:23:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:22,176 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2024-10-13 06:23:22,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2024-10-13 06:23:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:23:22,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:22,178 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:22,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:23:22,178 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:22,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash 505668401, now seen corresponding path program 1 times [2024-10-13 06:23:22,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:22,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579238142] [2024-10-13 06:23:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:22,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:22,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579238142] [2024-10-13 06:23:22,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579238142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:22,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:22,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:23:22,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108991990] [2024-10-13 06:23:22,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:22,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:23:22,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:22,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:23:22,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:23:22,683 INFO L87 Difference]: Start difference. First operand 193 states and 275 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:22,919 INFO L93 Difference]: Finished difference Result 385 states and 546 transitions. [2024-10-13 06:23:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:23:22,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-13 06:23:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:22,921 INFO L225 Difference]: With dead ends: 385 [2024-10-13 06:23:22,921 INFO L226 Difference]: Without dead ends: 242 [2024-10-13 06:23:22,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:23:22,922 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 239 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:22,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 703 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:23:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-13 06:23:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 193. [2024-10-13 06:23:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 155 states have internal predecessors, (206), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2024-10-13 06:23:22,940 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 146 [2024-10-13 06:23:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:22,941 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2024-10-13 06:23:22,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2024-10-13 06:23:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:23:22,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:22,942 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:22,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:23:22,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:22,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1349673903, now seen corresponding path program 1 times [2024-10-13 06:23:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756005555] [2024-10-13 06:23:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:23,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:23,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756005555] [2024-10-13 06:23:23,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756005555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:23,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:23,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:23:23,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414811562] [2024-10-13 06:23:23,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:23,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:23,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:23,399 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:23,480 INFO L93 Difference]: Finished difference Result 396 states and 562 transitions. [2024-10-13 06:23:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:23,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-13 06:23:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:23,483 INFO L225 Difference]: With dead ends: 396 [2024-10-13 06:23:23,483 INFO L226 Difference]: Without dead ends: 274 [2024-10-13 06:23:23,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:23,484 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 64 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:23,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 602 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-13 06:23:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 240. [2024-10-13 06:23:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 202 states have (on average 1.3663366336633664) internal successors, (276), 202 states have internal predecessors, (276), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 344 transitions. [2024-10-13 06:23:23,502 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 344 transitions. Word has length 146 [2024-10-13 06:23:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:23,502 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 344 transitions. [2024-10-13 06:23:23,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 344 transitions. [2024-10-13 06:23:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:23:23,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:23,505 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:23,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:23:23,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:23,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1511449808, now seen corresponding path program 1 times [2024-10-13 06:23:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041446913] [2024-10-13 06:23:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:24,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:25,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041446913] [2024-10-13 06:23:25,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041446913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:25,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:25,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:23:25,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044293875] [2024-10-13 06:23:25,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:25,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:23:25,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:23:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:23:25,035 INFO L87 Difference]: Start difference. First operand 240 states and 344 transitions. Second operand has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-13 06:23:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:25,490 INFO L93 Difference]: Finished difference Result 489 states and 691 transitions. [2024-10-13 06:23:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:23:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 147 [2024-10-13 06:23:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:25,493 INFO L225 Difference]: With dead ends: 489 [2024-10-13 06:23:25,494 INFO L226 Difference]: Without dead ends: 338 [2024-10-13 06:23:25,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:23:25,495 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 626 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:25,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1021 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:23:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-13 06:23:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 335. [2024-10-13 06:23:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 287 states have (on average 1.348432055749129) internal successors, (387), 288 states have internal predecessors, (387), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:23:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 471 transitions. [2024-10-13 06:23:25,524 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 471 transitions. Word has length 147 [2024-10-13 06:23:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:25,525 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 471 transitions. [2024-10-13 06:23:25,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-13 06:23:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 471 transitions. [2024-10-13 06:23:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:23:25,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:25,527 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:25,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:23:25,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:25,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1857300213, now seen corresponding path program 1 times [2024-10-13 06:23:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:25,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343614585] [2024-10-13 06:23:25,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:25,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:25,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343614585] [2024-10-13 06:23:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343614585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:25,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:23:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625433374] [2024-10-13 06:23:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:25,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:25,939 INFO L87 Difference]: Start difference. First operand 335 states and 471 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:26,072 INFO L93 Difference]: Finished difference Result 712 states and 999 transitions. [2024-10-13 06:23:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-13 06:23:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:26,076 INFO L225 Difference]: With dead ends: 712 [2024-10-13 06:23:26,076 INFO L226 Difference]: Without dead ends: 455 [2024-10-13 06:23:26,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:26,077 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 170 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:26,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 595 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-10-13 06:23:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 337. [2024-10-13 06:23:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 289 states have (on average 1.342560553633218) internal successors, (388), 290 states have internal predecessors, (388), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:23:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 472 transitions. [2024-10-13 06:23:26,109 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 472 transitions. Word has length 148 [2024-10-13 06:23:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:26,109 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 472 transitions. [2024-10-13 06:23:26,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 472 transitions. [2024-10-13 06:23:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 06:23:26,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:26,112 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:23:26,112 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:26,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -300608971, now seen corresponding path program 1 times [2024-10-13 06:23:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700043168] [2024-10-13 06:23:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700043168] [2024-10-13 06:23:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700043168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:26,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:23:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241395839] [2024-10-13 06:23:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:26,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:23:26,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:23:26,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:23:26,260 INFO L87 Difference]: Start difference. First operand 337 states and 472 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:26,375 INFO L93 Difference]: Finished difference Result 593 states and 832 transitions. [2024-10-13 06:23:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:23:26,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2024-10-13 06:23:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:26,377 INFO L225 Difference]: With dead ends: 593 [2024-10-13 06:23:26,378 INFO L226 Difference]: Without dead ends: 341 [2024-10-13 06:23:26,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:23:26,383 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:26,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-13 06:23:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-13 06:23:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 293 states have (on average 1.3378839590443685) internal successors, (392), 294 states have internal predecessors, (392), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:23:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 476 transitions. [2024-10-13 06:23:26,457 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 476 transitions. Word has length 149 [2024-10-13 06:23:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:26,463 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 476 transitions. [2024-10-13 06:23:26,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 476 transitions. [2024-10-13 06:23:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 06:23:26,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:26,466 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:26,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:23:26,466 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:26,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1726710340, now seen corresponding path program 1 times [2024-10-13 06:23:26,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:26,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501431947] [2024-10-13 06:23:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:27,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:27,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501431947] [2024-10-13 06:23:27,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501431947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:27,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:27,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:23:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560435679] [2024-10-13 06:23:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:27,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:23:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:27,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:23:27,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:23:27,441 INFO L87 Difference]: Start difference. First operand 341 states and 476 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 06:23:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:27,708 INFO L93 Difference]: Finished difference Result 351 states and 486 transitions. [2024-10-13 06:23:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:23:27,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 149 [2024-10-13 06:23:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:27,711 INFO L225 Difference]: With dead ends: 351 [2024-10-13 06:23:27,711 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 06:23:27,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:23:27,712 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 311 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:27,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 811 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:23:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 06:23:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-10-13 06:23:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 300 states have (on average 1.33) internal successors, (399), 301 states have internal predecessors, (399), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:23:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 483 transitions. [2024-10-13 06:23:27,745 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 483 transitions. Word has length 149 [2024-10-13 06:23:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:27,745 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 483 transitions. [2024-10-13 06:23:27,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 06:23:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 483 transitions. [2024-10-13 06:23:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 06:23:27,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:27,747 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:27,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:23:27,748 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:27,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1726769922, now seen corresponding path program 1 times [2024-10-13 06:23:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326276213] [2024-10-13 06:23:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:23:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326276213] [2024-10-13 06:23:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326276213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:23:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094386868] [2024-10-13 06:23:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:28,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:23:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:23:28,692 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) [2024-10-13 06:23:28,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:23:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:29,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 06:23:29,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:30,004 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 [2024-10-13 06:23:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-13 06:23:30,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:23:31,109 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 48 treesize of output 44 [2024-10-13 06:23:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:23:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094386868] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:23:31,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:23:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 24 [2024-10-13 06:23:31,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809375530] [2024-10-13 06:23:31,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:23:31,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 06:23:31,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:31,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 06:23:31,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:23:31,511 INFO L87 Difference]: Start difference. First operand 349 states and 483 transitions. Second operand has 24 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 11 states have call successors, (51), 4 states have call predecessors, (51), 6 states have return successors, (51), 8 states have call predecessors, (51), 11 states have call successors, (51) [2024-10-13 06:23:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:32,509 INFO L93 Difference]: Finished difference Result 911 states and 1247 transitions. [2024-10-13 06:23:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 06:23:32,510 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 11 states have call successors, (51), 4 states have call predecessors, (51), 6 states have return successors, (51), 8 states have call predecessors, (51), 11 states have call successors, (51) Word has length 149 [2024-10-13 06:23:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:32,514 INFO L225 Difference]: With dead ends: 911 [2024-10-13 06:23:32,514 INFO L226 Difference]: Without dead ends: 645 [2024-10-13 06:23:32,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 06:23:32,516 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 308 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:32,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1685 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:23:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-13 06:23:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 617. [2024-10-13 06:23:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 536 states have (on average 1.328358208955224) internal successors, (712), 538 states have internal predecessors, (712), 67 states have call successors, (67), 13 states have call predecessors, (67), 13 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:23:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 846 transitions. [2024-10-13 06:23:32,569 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 846 transitions. Word has length 149 [2024-10-13 06:23:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:32,569 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 846 transitions. [2024-10-13 06:23:32,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 11 states have call successors, (51), 4 states have call predecessors, (51), 6 states have return successors, (51), 8 states have call predecessors, (51), 11 states have call successors, (51) [2024-10-13 06:23:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 846 transitions. [2024-10-13 06:23:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 06:23:32,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:32,572 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:32,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:23:32,776 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,SelfDestructingSolverStorable14 [2024-10-13 06:23:32,777 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:32,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1672809466, now seen corresponding path program 1 times [2024-10-13 06:23:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007309297] [2024-10-13 06:23:32,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007309297] [2024-10-13 06:23:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007309297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:33,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:23:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689180572] [2024-10-13 06:23:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:33,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:33,184 INFO L87 Difference]: Start difference. First operand 617 states and 846 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:33,276 INFO L93 Difference]: Finished difference Result 994 states and 1368 transitions. [2024-10-13 06:23:33,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:33,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-13 06:23:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:33,281 INFO L225 Difference]: With dead ends: 994 [2024-10-13 06:23:33,281 INFO L226 Difference]: Without dead ends: 742 [2024-10-13 06:23:33,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:33,283 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 144 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:33,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 570 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-10-13 06:23:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 645. [2024-10-13 06:23:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 564 states have (on average 1.3351063829787233) internal successors, (753), 566 states have internal predecessors, (753), 67 states have call successors, (67), 13 states have call predecessors, (67), 13 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:23:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 887 transitions. [2024-10-13 06:23:33,337 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 887 transitions. Word has length 150 [2024-10-13 06:23:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:33,338 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 887 transitions. [2024-10-13 06:23:33,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 887 transitions. [2024-10-13 06:23:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 06:23:33,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:33,340 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:33,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:23:33,341 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:33,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:33,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2095511292, now seen corresponding path program 1 times [2024-10-13 06:23:33,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:33,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690000484] [2024-10-13 06:23:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:33,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:34,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690000484] [2024-10-13 06:23:34,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690000484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:34,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:34,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:23:34,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689498961] [2024-10-13 06:23:34,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:34,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:23:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:34,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:23:34,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:23:34,079 INFO L87 Difference]: Start difference. First operand 645 states and 887 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:34,354 INFO L93 Difference]: Finished difference Result 1385 states and 1899 transitions. [2024-10-13 06:23:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:23:34,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-13 06:23:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:34,359 INFO L225 Difference]: With dead ends: 1385 [2024-10-13 06:23:34,359 INFO L226 Difference]: Without dead ends: 859 [2024-10-13 06:23:34,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:23:34,361 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 230 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:34,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 836 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:23:34,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-10-13 06:23:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 663. [2024-10-13 06:23:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 582 states have (on average 1.324742268041237) internal successors, (771), 584 states have internal predecessors, (771), 67 states have call successors, (67), 13 states have call predecessors, (67), 13 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:23:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 905 transitions. [2024-10-13 06:23:34,414 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 905 transitions. Word has length 150 [2024-10-13 06:23:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:34,415 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 905 transitions. [2024-10-13 06:23:34,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 905 transitions. [2024-10-13 06:23:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 06:23:34,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:34,417 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:34,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:23:34,417 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:34,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2079593437, now seen corresponding path program 1 times [2024-10-13 06:23:34,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:34,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021510798] [2024-10-13 06:23:34,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:34,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:34,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021510798] [2024-10-13 06:23:34,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021510798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:23:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665561254] [2024-10-13 06:23:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:34,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:34,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:34,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:34,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:34,792 INFO L87 Difference]: Start difference. First operand 663 states and 905 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:34,996 INFO L93 Difference]: Finished difference Result 1461 states and 1993 transitions. [2024-10-13 06:23:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:34,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-10-13 06:23:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:35,003 INFO L225 Difference]: With dead ends: 1461 [2024-10-13 06:23:35,003 INFO L226 Difference]: Without dead ends: 935 [2024-10-13 06:23:35,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:35,008 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 85 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:35,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 548 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-10-13 06:23:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 932. [2024-10-13 06:23:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 827 states have (on average 1.3180169286577992) internal successors, (1090), 831 states have internal predecessors, (1090), 85 states have call successors, (85), 19 states have call predecessors, (85), 19 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-10-13 06:23:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1260 transitions. [2024-10-13 06:23:35,109 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1260 transitions. Word has length 151 [2024-10-13 06:23:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:35,109 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1260 transitions. [2024-10-13 06:23:35,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1260 transitions. [2024-10-13 06:23:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 06:23:35,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:35,112 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:35,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:23:35,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:35,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1617909796, now seen corresponding path program 1 times [2024-10-13 06:23:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51994902] [2024-10-13 06:23:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:35,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51994902] [2024-10-13 06:23:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51994902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:35,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:35,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:23:35,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316684782] [2024-10-13 06:23:35,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:35,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:23:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:35,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:23:35,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:23:35,237 INFO L87 Difference]: Start difference. First operand 932 states and 1260 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:35,313 INFO L93 Difference]: Finished difference Result 1689 states and 2303 transitions. [2024-10-13 06:23:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:23:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-10-13 06:23:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:35,318 INFO L225 Difference]: With dead ends: 1689 [2024-10-13 06:23:35,318 INFO L226 Difference]: Without dead ends: 938 [2024-10-13 06:23:35,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:23:35,321 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 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 [2024-10-13 06:23:35,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-10-13 06:23:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2024-10-13 06:23:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 833 states have (on average 1.3157262905162064) internal successors, (1096), 837 states have internal predecessors, (1096), 85 states have call successors, (85), 19 states have call predecessors, (85), 19 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-10-13 06:23:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1266 transitions. [2024-10-13 06:23:35,390 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1266 transitions. Word has length 151 [2024-10-13 06:23:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:35,390 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1266 transitions. [2024-10-13 06:23:35,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1266 transitions. [2024-10-13 06:23:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 06:23:35,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:35,392 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:35,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:23:35,393 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:35,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:35,393 INFO L85 PathProgramCache]: Analyzing trace with hash -434666915, now seen corresponding path program 1 times [2024-10-13 06:23:35,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:35,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554878881] [2024-10-13 06:23:35,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:35,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:35,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554878881] [2024-10-13 06:23:35,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554878881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:35,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:35,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:23:35,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16329698] [2024-10-13 06:23:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:35,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:35,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:35,710 INFO L87 Difference]: Start difference. First operand 938 states and 1266 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:35,825 INFO L93 Difference]: Finished difference Result 1662 states and 2242 transitions. [2024-10-13 06:23:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:35,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-10-13 06:23:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:35,831 INFO L225 Difference]: With dead ends: 1662 [2024-10-13 06:23:35,831 INFO L226 Difference]: Without dead ends: 1111 [2024-10-13 06:23:35,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:35,833 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 75 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:35,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 608 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2024-10-13 06:23:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 890. [2024-10-13 06:23:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 785 states have (on average 1.3159235668789808) internal successors, (1033), 789 states have internal predecessors, (1033), 85 states have call successors, (85), 19 states have call predecessors, (85), 19 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-10-13 06:23:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1203 transitions. [2024-10-13 06:23:35,944 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1203 transitions. Word has length 151 [2024-10-13 06:23:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:35,945 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1203 transitions. [2024-10-13 06:23:35,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1203 transitions. [2024-10-13 06:23:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 06:23:35,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:35,947 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:35,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:23:35,947 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:35,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -206533973, now seen corresponding path program 1 times [2024-10-13 06:23:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134947587] [2024-10-13 06:23:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:23:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:23:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:23:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:23:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:23:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:36,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:36,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134947587] [2024-10-13 06:23:36,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134947587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:36,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:36,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:23:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62636203] [2024-10-13 06:23:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:36,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:23:36,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:36,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:23:36,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:23:36,531 INFO L87 Difference]: Start difference. First operand 890 states and 1203 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:37,041 INFO L93 Difference]: Finished difference Result 2045 states and 2765 transitions. [2024-10-13 06:23:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:23:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2024-10-13 06:23:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:37,049 INFO L225 Difference]: With dead ends: 2045 [2024-10-13 06:23:37,049 INFO L226 Difference]: Without dead ends: 1290 [2024-10-13 06:23:37,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:23:37,053 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 403 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:37,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 940 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:23:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2024-10-13 06:23:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1231. [2024-10-13 06:23:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1082 states have (on average 1.3022181146025877) internal successors, (1409), 1089 states have internal predecessors, (1409), 120 states have call successors, (120), 28 states have call predecessors, (120), 28 states have return successors, (120), 113 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 06:23:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1649 transitions. [2024-10-13 06:23:37,175 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1649 transitions. Word has length 153 [2024-10-13 06:23:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:37,176 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1649 transitions. [2024-10-13 06:23:37,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1649 transitions. [2024-10-13 06:23:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 06:23:37,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:37,178 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:37,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:23:37,178 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:37,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash -273165896, now seen corresponding path program 1 times [2024-10-13 06:23:37,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:37,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308318190] [2024-10-13 06:23:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:37,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:23:37,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:23:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:23:37,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:23:37,580 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:23:37,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:23:37,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:23:37,587 INFO L407 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] [2024-10-13 06:23:37,780 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:23:37,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:23:37 BoogieIcfgContainer [2024-10-13 06:23:37,782 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:23:37,783 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:23:37,783 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:23:37,783 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:23:37,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:23:17" (3/4) ... [2024-10-13 06:23:37,785 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:23:37,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:23:37,787 INFO L158 Benchmark]: Toolchain (without parser) took 21687.78ms. Allocated memory was 165.7MB in the beginning and 786.4MB in the end (delta: 620.8MB). Free memory was 93.7MB in the beginning and 690.0MB in the end (delta: -596.3MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-10-13 06:23:37,787 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 165.7MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:23:37,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.48ms. Allocated memory is still 165.7MB. Free memory was 93.6MB in the beginning and 133.0MB in the end (delta: -39.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-10-13 06:23:37,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.23ms. Allocated memory is still 165.7MB. Free memory was 133.0MB in the beginning and 128.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:23:37,788 INFO L158 Benchmark]: Boogie Preprocessor took 109.47ms. Allocated memory is still 165.7MB. Free memory was 128.8MB in the beginning and 123.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:23:37,788 INFO L158 Benchmark]: RCFGBuilder took 926.67ms. Allocated memory is still 165.7MB. Free memory was 123.6MB in the beginning and 66.9MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-13 06:23:37,789 INFO L158 Benchmark]: TraceAbstraction took 20094.16ms. Allocated memory was 165.7MB in the beginning and 786.4MB in the end (delta: 620.8MB). Free memory was 65.9MB in the beginning and 690.0MB in the end (delta: -624.2MB). Peak memory consumption was 409.6MB. Max. memory is 16.1GB. [2024-10-13 06:23:37,789 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 786.4MB. Free memory is still 690.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:23:37,790 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.22ms. Allocated memory is still 165.7MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.48ms. Allocated memory is still 165.7MB. Free memory was 93.6MB in the beginning and 133.0MB in the end (delta: -39.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.23ms. Allocated memory is still 165.7MB. Free memory was 133.0MB in the beginning and 128.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.47ms. Allocated memory is still 165.7MB. Free memory was 128.8MB in the beginning and 123.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 926.67ms. Allocated memory is still 165.7MB. Free memory was 123.6MB in the beginning and 66.9MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20094.16ms. Allocated memory was 165.7MB in the beginning and 786.4MB in the end (delta: 620.8MB). Free memory was 65.9MB in the beginning and 690.0MB in the end (delta: -624.2MB). Peak memory consumption was 409.6MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 786.4MB. Free memory is still 690.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of bitwiseOr at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L22] signed char var_1_1 = -8; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_5 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char* var_1_5_Pointer = &(var_1_5); [L26] unsigned char var_1_6 = 1; [L26] unsigned char var_1_6 = 1; [L27] unsigned char* var_1_6_Pointer = &(var_1_6); [L28] signed char var_1_7 = -1; [L28] signed char var_1_7 = -1; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] signed char var_1_8 = -50; [L30] signed char var_1_8 = -50; [L31] signed char* var_1_8_Pointer = &(var_1_8); [L32] signed char var_1_9 = 100; [L32] signed char var_1_9 = 100; [L33] signed char* var_1_9_Pointer = &(var_1_9); [L34] unsigned long int var_1_10 = 25; [L34] unsigned long int var_1_10 = 25; [L35] unsigned long int* var_1_10_Pointer = &(var_1_10); [L36] unsigned long int var_1_11 = 2568920345; [L36] unsigned long int var_1_11 = 2568920345; [L37] unsigned long int* var_1_11_Pointer = &(var_1_11); [L38] unsigned long int var_1_12 = 1191097264; [L38] unsigned long int var_1_12 = 1191097264; [L39] unsigned long int* var_1_12_Pointer = &(var_1_12); [L40] unsigned long int var_1_13 = 1801344522; [L40] unsigned long int var_1_13 = 1801344522; [L41] unsigned long int* var_1_13_Pointer = &(var_1_13); [L42] signed long int var_1_14 = 64; [L42] signed long int var_1_14 = 64; [L43] signed long int* var_1_14_Pointer = &(var_1_14); [L44] signed short int var_1_15 = -16; [L44] signed short int var_1_15 = -16; [L45] signed short int* var_1_15_Pointer = &(var_1_15); [L46] float var_1_16 = 1000000.5; [L46] float var_1_16 = 1000000.5; [L47] float* var_1_16_Pointer = &(var_1_16); [L48] float var_1_17 = 4.5; [L48] float var_1_17 = 4.5; [L49] float* var_1_17_Pointer = &(var_1_17); [L50] unsigned char var_1_18 = 0; [L50] unsigned char var_1_18 = 0; [L51] unsigned char* var_1_18_Pointer = &(var_1_18); [L52] unsigned char var_1_19 = 128; [L52] unsigned char var_1_19 = 128; [L53] unsigned char* var_1_19_Pointer = &(var_1_19); [L54] unsigned long int last_1_var_1_10 = 25; [L55] signed short int last_1_var_1_15 = -16; [L56] unsigned char last_1_var_1_18 = 0; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] EXPR \read(var_1_10) [L114] last_1_var_1_10 = var_1_10 [L115] EXPR \read(var_1_15) [L115] last_1_var_1_15 = var_1_15 [L116] EXPR \read(var_1_18) [L116] last_1_var_1_18 = var_1_18 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L86] var_1_5 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] var_1_7 = __VERIFIER_nondet_char() [L93] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] var_1_9 = __VERIFIER_nondet_char() [L96] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] var_1_11 = __VERIFIER_nondet_ulong() [L99] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] var_1_12 = __VERIFIER_nondet_ulong() [L102] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] var_1_13 = __VERIFIER_nondet_ulong() [L105] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L106] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L106] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L106] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] var_1_17 = __VERIFIER_nondet_float() [L108] EXPR \read(var_1_17) [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F [L108] EXPR \read(var_1_17) [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR (var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR (var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L109] var_1_19 = __VERIFIER_nondet_uchar() [L110] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L110] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L110] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L127] RET updateVariables() [L128] CALL step() [L60] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) [L60] EXPR \read(*var_1_5_Pointer) [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] COND FALSE !(((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) [L67] EXPR \read(*var_1_7_Pointer) [L67] (*(var_1_1_Pointer)) = (*(var_1_7_Pointer)) [L69] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L69] COND FALSE !((*(var_1_5_Pointer))) [L72] EXPR \read(*var_1_12_Pointer) [L72] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L72] COND TRUE (*(var_1_12_Pointer)) <= (*(var_1_8_Pointer)) [L73] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L73] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) [L73] EXPR \read(*var_1_8_Pointer) [L73] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L73] (*(var_1_14_Pointer)) = (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) [L75] (*(var_1_15_Pointer)) = 2 [L76] EXPR \read(*var_1_17_Pointer) [L76] (*(var_1_16_Pointer)) = (*(var_1_17_Pointer)) [L77] EXPR \read(*var_1_19_Pointer) [L77] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L78] EXPR \read(*var_1_8_Pointer) [L78] EXPR \read(*var_1_1_Pointer) [L78] unsigned char stepLocal_0 = (*(var_1_8_Pointer)) < (*(var_1_1_Pointer)); [L79] stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] COND FALSE !(stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) [L82] EXPR \read(*var_1_11_Pointer) [L82] EXPR \read(*var_1_13_Pointer) [L82] (*(var_1_10_Pointer)) = ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) [L119] EXPR \read(*var_1_5_Pointer) [L119] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) [L119] EXPR \read(*var_1_1_Pointer) [L119] EXPR \read(*var_1_7_Pointer) [L119] EXPR (((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) [L119] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1 [L119] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) [L119] EXPR \read(*var_1_8_Pointer) [L119] EXPR \read(*var_1_1_Pointer) [L119] EXPR ((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))) [L119] EXPR \read(*var_1_10_Pointer) [L119] EXPR \read(*var_1_11_Pointer) [L119] EXPR \read(*var_1_13_Pointer) [L119] EXPR (((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) [L119] EXPR \read(*var_1_12_Pointer) [L119] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1 [L119] EXPR \read(*var_1_14_Pointer) [L119] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) [L119] EXPR \read(*var_1_8_Pointer) [L119] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) [L119] EXPR \read(*var_1_15_Pointer) [L119] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) [L119] EXPR \read(*var_1_16_Pointer) [L119] EXPR \read(*var_1_17_Pointer) [L119] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119-L120] return (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 22, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2990 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2990 mSDsluCounter, 13384 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9893 mSDsCounter, 435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2581 IncrementalHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 435 mSolverCounterUnsat, 3491 mSDtfsCounter, 2581 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1069 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1231occurred in iteration=21, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 864 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 3355 NumberOfCodeBlocks, 3355 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3328 ConstructedInterpolants, 0 QuantifiedInterpolants, 12170 SizeOfPredicates, 6 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 12203/12512 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:23:37,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.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 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:23:41,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:23:41,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:23:41,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:23:41,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:23:41,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:23:41,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:23:41,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:23:41,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:23:41,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:23:41,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:23:41,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:23:41,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:23:41,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:23:41,417 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:23:41,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:23:41,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:23:41,418 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:23:41,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:23:41,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:23:41,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:23:41,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:23:41,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:23:41,423 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:23:41,423 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:23:41,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:23:41,424 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:23:41,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:23:41,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:23:41,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:23:41,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:23:41,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:23:41,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:23:41,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:23:41,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:23:41,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:23:41,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:23:41,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:23:41,441 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:23:41,441 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:23:41,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:23:41,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:23:41,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:23:41,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:23:41,443 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:23:41,443 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 [2024-10-13 06:23:41,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:23:41,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:23:41,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:23:41,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:23:41,866 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:23:41,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2024-10-13 06:23:43,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:23:43,990 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:23:43,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2024-10-13 06:23:44,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8730161f0/66c1bcada5694df48a7d4813e4e8b4bd/FLAG460d0a7d8 [2024-10-13 06:23:44,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8730161f0/66c1bcada5694df48a7d4813e4e8b4bd [2024-10-13 06:23:44,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:23:44,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:23:44,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:23:44,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:23:44,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:23:44,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e971d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44, skipping insertion in model container [2024-10-13 06:23:44,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:23:44,599 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i[916,929] [2024-10-13 06:23:44,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:23:44,703 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:23:44,725 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i[916,929] [2024-10-13 06:23:44,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:23:44,802 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:23:44,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44 WrapperNode [2024-10-13 06:23:44,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:23:44,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:23:44,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:23:44,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:23:44,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,880 INFO L138 Inliner]: procedures = 36, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2024-10-13 06:23:44,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:23:44,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:23:44,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:23:44,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:23:44,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,957 INFO L175 MemorySlicer]: Split 134 memory accesses to 17 slices as follows [2, 9, 10, 6, 16, 17, 12, 6, 8, 10, 10, 3, 4, 3, 8, 4, 6]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-13 06:23:44,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:44,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:45,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:45,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:45,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:45,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:23:45,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:23:45,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:23:45,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:23:45,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (1/1) ... [2024-10-13 06:23:45,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:23:45,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:23:45,108 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) [2024-10-13 06:23:45,114 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 [2024-10-13 06:23:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:23:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:23:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:23:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 06:23:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 06:23:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 06:23:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-13 06:23:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-13 06:23:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-13 06:23:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-13 06:23:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-13 06:23:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-13 06:23:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-13 06:23:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-13 06:23:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-13 06:23:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-13 06:23:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-13 06:23:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-10-13 06:23:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:23:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:23:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 06:23:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 06:23:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 06:23:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-13 06:23:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-13 06:23:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-13 06:23:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-13 06:23:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-13 06:23:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-13 06:23:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-13 06:23:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-13 06:23:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-13 06:23:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-13 06:23:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-13 06:23:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-13 06:23:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-13 06:23:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-13 06:23:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-13 06:23:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-13 06:23:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-13 06:23:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-13 06:23:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-10-13 06:23:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-10-13 06:23:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-10-13 06:23:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2024-10-13 06:23:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:23:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:23:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-13 06:23:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-13 06:23:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-13 06:23:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-13 06:23:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-13 06:23:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-13 06:23:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-13 06:23:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-13 06:23:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-13 06:23:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-13 06:23:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-13 06:23:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-13 06:23:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-13 06:23:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-13 06:23:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2024-10-13 06:23:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:23:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:23:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 06:23:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-13 06:23:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-13 06:23:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-13 06:23:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-13 06:23:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-13 06:23:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-13 06:23:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-13 06:23:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-13 06:23:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-13 06:23:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-13 06:23:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-10-13 06:23:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-10-13 06:23:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-10-13 06:23:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2024-10-13 06:23:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:23:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:23:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 06:23:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 06:23:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 06:23:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-13 06:23:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-13 06:23:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-13 06:23:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:23:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-13 06:23:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-13 06:23:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-13 06:23:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-13 06:23:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-13 06:23:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-13 06:23:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-13 06:23:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-13 06:23:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-13 06:23:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-13 06:23:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-13 06:23:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-13 06:23:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-13 06:23:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-13 06:23:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2024-10-13 06:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-13 06:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-13 06:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-13 06:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-13 06:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-13 06:23:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:23:45,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:23:45,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:23:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 06:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 06:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 06:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-13 06:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-13 06:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-13 06:23:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-13 06:23:45,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-13 06:23:45,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-13 06:23:45,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-13 06:23:45,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-13 06:23:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-13 06:23:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-13 06:23:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-13 06:23:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-10-13 06:23:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:23:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:23:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 06:23:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 06:23:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 06:23:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-13 06:23:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-13 06:23:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-13 06:23:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-13 06:23:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-13 06:23:45,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-13 06:23:45,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-13 06:23:45,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-13 06:23:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-13 06:23:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-13 06:23:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-13 06:23:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2024-10-13 06:23:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:23:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-13 06:23:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-13 06:23:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-10-13 06:23:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-10-13 06:23:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-10-13 06:23:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2024-10-13 06:23:45,493 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:23:45,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:23:46,151 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-13 06:23:46,153 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:23:46,215 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:23:46,217 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:23:46,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:23:46 BoogieIcfgContainer [2024-10-13 06:23:46,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:23:46,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:23:46,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:23:46,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:23:46,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:23:44" (1/3) ... [2024-10-13 06:23:46,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df035fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:23:46, skipping insertion in model container [2024-10-13 06:23:46,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:44" (2/3) ... [2024-10-13 06:23:46,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df035fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:23:46, skipping insertion in model container [2024-10-13 06:23:46,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:23:46" (3/3) ... [2024-10-13 06:23:46,228 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-88.i [2024-10-13 06:23:46,245 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:23:46,245 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:23:46,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:23:46,334 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;@58cf628d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:23:46,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:23:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:23:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:23:46,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:46,357 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:46,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash -79282582, now seen corresponding path program 1 times [2024-10-13 06:23:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:46,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540224316] [2024-10-13 06:23:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:46,383 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 [2024-10-13 06:23:46,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:46,386 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) [2024-10-13 06:23:46,388 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 [2024-10-13 06:23:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:46,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:23:46,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-13 06:23:46,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:23:46,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:46,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540224316] [2024-10-13 06:23:46,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540224316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:46,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:46,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:23:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065486202] [2024-10-13 06:23:46,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:46,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:23:46,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:46,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:23:46,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:23:46,846 INFO L87 Difference]: Start difference. First operand has 104 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:23:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:46,892 INFO L93 Difference]: Finished difference Result 205 states and 327 transitions. [2024-10-13 06:23:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:23:46,894 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-13 06:23:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:46,901 INFO L225 Difference]: With dead ends: 205 [2024-10-13 06:23:46,902 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 06:23:46,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:23:46,908 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:46,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 06:23:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-13 06:23:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:23:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2024-10-13 06:23:46,950 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 134 [2024-10-13 06:23:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:46,950 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2024-10-13 06:23:46,951 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:23:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-10-13 06:23:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:23:46,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:46,954 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:46,963 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 06:23:47,157 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 [2024-10-13 06:23:47,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:47,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1683331500, now seen corresponding path program 1 times [2024-10-13 06:23:47,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:47,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681318988] [2024-10-13 06:23:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:47,160 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 [2024-10-13 06:23:47,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:47,180 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) [2024-10-13 06:23:47,188 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 [2024-10-13 06:23:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:47,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:23:47,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:48,673 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 9 [2024-10-13 06:23:48,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 06:23:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-13 06:23:48,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:23:49,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:23:49,025 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 22 treesize of output 25 [2024-10-13 06:23:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:23:49,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:49,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681318988] [2024-10-13 06:23:49,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681318988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:23:49,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:23:49,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 06:23:49,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632330965] [2024-10-13 06:23:49,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:23:49,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:23:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:23:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:23:49,613 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-13 06:23:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:50,687 INFO L93 Difference]: Finished difference Result 312 states and 458 transitions. [2024-10-13 06:23:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:23:50,688 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 134 [2024-10-13 06:23:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:50,691 INFO L225 Difference]: With dead ends: 312 [2024-10-13 06:23:50,691 INFO L226 Difference]: Without dead ends: 211 [2024-10-13 06:23:50,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:23:50,694 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 480 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:50,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 997 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:23:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-13 06:23:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 203. [2024-10-13 06:23:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 165 states have (on average 1.4) internal successors, (231), 165 states have internal predecessors, (231), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2024-10-13 06:23:50,722 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 134 [2024-10-13 06:23:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:50,723 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2024-10-13 06:23:50,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-13 06:23:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2024-10-13 06:23:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:23:50,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:50,725 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:50,739 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 [2024-10-13 06:23:50,929 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 [2024-10-13 06:23:50,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:50,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash -398032199, now seen corresponding path program 1 times [2024-10-13 06:23:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:50,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850573882] [2024-10-13 06:23:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:50,933 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 [2024-10-13 06:23:50,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:50,941 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) [2024-10-13 06:23:50,950 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 [2024-10-13 06:23:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:51,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:23:51,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:51,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:23:51,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:51,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850573882] [2024-10-13 06:23:51,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850573882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:51,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:23:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681570949] [2024-10-13 06:23:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:51,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:23:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:51,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:23:51,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:51,279 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:51,372 INFO L93 Difference]: Finished difference Result 419 states and 617 transitions. [2024-10-13 06:23:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:23:51,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-13 06:23:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:51,375 INFO L225 Difference]: With dead ends: 419 [2024-10-13 06:23:51,375 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 06:23:51,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:51,378 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:51,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 687 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 06:23:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2024-10-13 06:23:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 177 states have internal predecessors, (243), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2024-10-13 06:23:51,401 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 136 [2024-10-13 06:23:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:51,401 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2024-10-13 06:23:51,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2024-10-13 06:23:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:23:51,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:51,411 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:51,420 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 [2024-10-13 06:23:51,611 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 [2024-10-13 06:23:51,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1207378825, now seen corresponding path program 1 times [2024-10-13 06:23:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239304066] [2024-10-13 06:23:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:51,616 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 [2024-10-13 06:23:51,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:51,619 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) [2024-10-13 06:23:51,622 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 [2024-10-13 06:23:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:51,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 06:23:51,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:51,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:23:51,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:51,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239304066] [2024-10-13 06:23:51,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239304066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:51,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:51,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:23:51,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317358550] [2024-10-13 06:23:51,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:51,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:23:51,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:51,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:23:51,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:23:51,963 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:52,065 INFO L93 Difference]: Finished difference Result 439 states and 635 transitions. [2024-10-13 06:23:52,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:23:52,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-13 06:23:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:52,067 INFO L225 Difference]: With dead ends: 439 [2024-10-13 06:23:52,067 INFO L226 Difference]: Without dead ends: 225 [2024-10-13 06:23:52,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:23:52,070 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:52,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 942 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-13 06:23:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-13 06:23:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 185 states have internal predecessors, (251), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 319 transitions. [2024-10-13 06:23:52,088 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 319 transitions. Word has length 136 [2024-10-13 06:23:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:52,089 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 319 transitions. [2024-10-13 06:23:52,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 319 transitions. [2024-10-13 06:23:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:23:52,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:52,092 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:52,106 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 [2024-10-13 06:23:52,296 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 [2024-10-13 06:23:52,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:52,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1207319243, now seen corresponding path program 1 times [2024-10-13 06:23:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:52,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058292427] [2024-10-13 06:23:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:52,299 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 [2024-10-13 06:23:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:52,302 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) [2024-10-13 06:23:52,303 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 [2024-10-13 06:23:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:52,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 06:23:52,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:52,988 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 17 treesize of output 13 [2024-10-13 06:23:53,072 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 49 treesize of output 37 [2024-10-13 06:23:53,202 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 67 treesize of output 51 [2024-10-13 06:23:53,207 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 60 treesize of output 40 [2024-10-13 06:23:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-10-13 06:23:53,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:23:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:53,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058292427] [2024-10-13 06:23:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058292427] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:23:53,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:23:53,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-10-13 06:23:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575734531] [2024-10-13 06:23:53,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:53,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:23:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:53,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:23:53,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:23:53,477 INFO L87 Difference]: Start difference. First operand 223 states and 319 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:53,725 INFO L93 Difference]: Finished difference Result 470 states and 665 transitions. [2024-10-13 06:23:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:23:53,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-13 06:23:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:53,728 INFO L225 Difference]: With dead ends: 470 [2024-10-13 06:23:53,728 INFO L226 Difference]: Without dead ends: 248 [2024-10-13 06:23:53,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:23:53,730 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 191 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:53,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 544 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:23:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-13 06:23:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 235. [2024-10-13 06:23:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 195 states have (on average 1.3384615384615384) internal successors, (261), 195 states have internal predecessors, (261), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 329 transitions. [2024-10-13 06:23:53,748 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 329 transitions. Word has length 136 [2024-10-13 06:23:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:53,748 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 329 transitions. [2024-10-13 06:23:53,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 329 transitions. [2024-10-13 06:23:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:23:53,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:53,751 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:53,760 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 [2024-10-13 06:23:53,952 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 [2024-10-13 06:23:53,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:53,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1253009667, now seen corresponding path program 1 times [2024-10-13 06:23:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044775441] [2024-10-13 06:23:53,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:53,954 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 [2024-10-13 06:23:53,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:53,957 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) [2024-10-13 06:23:53,958 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 [2024-10-13 06:23:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:54,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:23:54,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:54,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:23:54,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:54,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044775441] [2024-10-13 06:23:54,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044775441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:54,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:54,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:23:54,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114931618] [2024-10-13 06:23:54,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:54,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:54,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:54,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:54,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:54,248 INFO L87 Difference]: Start difference. First operand 235 states and 329 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:54,302 INFO L93 Difference]: Finished difference Result 475 states and 665 transitions. [2024-10-13 06:23:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:54,302 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-13 06:23:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:54,304 INFO L225 Difference]: With dead ends: 475 [2024-10-13 06:23:54,304 INFO L226 Difference]: Without dead ends: 241 [2024-10-13 06:23:54,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:54,305 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:54,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-13 06:23:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-10-13 06:23:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 201 states have (on average 1.328358208955224) internal successors, (267), 201 states have internal predecessors, (267), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 335 transitions. [2024-10-13 06:23:54,321 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 335 transitions. Word has length 138 [2024-10-13 06:23:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:54,322 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 335 transitions. [2024-10-13 06:23:54,322 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 335 transitions. [2024-10-13 06:23:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:23:54,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:54,324 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:54,334 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 [2024-10-13 06:23:54,524 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 [2024-10-13 06:23:54,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:54,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:54,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1222125267, now seen corresponding path program 1 times [2024-10-13 06:23:54,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:54,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513962853] [2024-10-13 06:23:54,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:54,527 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 [2024-10-13 06:23:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:54,530 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) [2024-10-13 06:23:54,531 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 [2024-10-13 06:23:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:54,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:23:54,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 06:23:55,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:23:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:55,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:55,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513962853] [2024-10-13 06:23:55,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513962853] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:23:55,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:23:55,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-13 06:23:55,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13630754] [2024-10-13 06:23:55,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:55,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:55,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:55,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:55,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:23:55,231 INFO L87 Difference]: Start difference. First operand 241 states and 335 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:55,323 INFO L93 Difference]: Finished difference Result 605 states and 842 transitions. [2024-10-13 06:23:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:23:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-10-13 06:23:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:55,327 INFO L225 Difference]: With dead ends: 605 [2024-10-13 06:23:55,327 INFO L226 Difference]: Without dead ends: 365 [2024-10-13 06:23:55,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:23:55,328 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 62 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:55,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 582 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-13 06:23:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 277. [2024-10-13 06:23:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 237 states have (on average 1.3544303797468353) internal successors, (321), 237 states have internal predecessors, (321), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:23:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 389 transitions. [2024-10-13 06:23:55,356 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 389 transitions. Word has length 139 [2024-10-13 06:23:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:55,357 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 389 transitions. [2024-10-13 06:23:55,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 389 transitions. [2024-10-13 06:23:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:23:55,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:55,360 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:55,370 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 [2024-10-13 06:23:55,561 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 [2024-10-13 06:23:55,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:55,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash -947365653, now seen corresponding path program 1 times [2024-10-13 06:23:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489316057] [2024-10-13 06:23:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:55,564 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 [2024-10-13 06:23:55,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:55,567 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:23:55,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 06:23:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:55,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:23:55,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:55,849 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 9 [2024-10-13 06:23:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:56,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:23:56,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:56,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489316057] [2024-10-13 06:23:56,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489316057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:56,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:56,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:23:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871752811] [2024-10-13 06:23:56,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:56,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:56,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:56,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:23:56,026 INFO L87 Difference]: Start difference. First operand 277 states and 389 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:56,189 INFO L93 Difference]: Finished difference Result 773 states and 1083 transitions. [2024-10-13 06:23:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:56,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-10-13 06:23:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:56,193 INFO L225 Difference]: With dead ends: 773 [2024-10-13 06:23:56,193 INFO L226 Difference]: Without dead ends: 497 [2024-10-13 06:23:56,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:23:56,195 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:56,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 575 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-13 06:23:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 330. [2024-10-13 06:23:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 270 states have (on average 1.3222222222222222) internal successors, (357), 270 states have internal predecessors, (357), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-13 06:23:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 459 transitions. [2024-10-13 06:23:56,220 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 459 transitions. Word has length 139 [2024-10-13 06:23:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:56,220 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 459 transitions. [2024-10-13 06:23:56,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 459 transitions. [2024-10-13 06:23:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:23:56,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:56,222 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:56,232 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 [2024-10-13 06:23:56,423 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 [2024-10-13 06:23:56,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:56,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:56,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1297784254, now seen corresponding path program 1 times [2024-10-13 06:23:56,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:56,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134099278] [2024-10-13 06:23:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:56,426 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 [2024-10-13 06:23:56,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:56,429 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) [2024-10-13 06:23:56,430 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 [2024-10-13 06:23:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:56,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:23:56,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 06:23:57,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:23:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:57,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134099278] [2024-10-13 06:23:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134099278] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:23:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:23:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-13 06:23:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763455569] [2024-10-13 06:23:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:57,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:23:57,207 INFO L87 Difference]: Start difference. First operand 330 states and 459 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:57,298 INFO L93 Difference]: Finished difference Result 680 states and 944 transitions. [2024-10-13 06:23:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:57,299 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-10-13 06:23:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:57,303 INFO L225 Difference]: With dead ends: 680 [2024-10-13 06:23:57,304 INFO L226 Difference]: Without dead ends: 404 [2024-10-13 06:23:57,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:23:57,306 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 108 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:57,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 417 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-13 06:23:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 338. [2024-10-13 06:23:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 278 states have (on average 1.3129496402877698) internal successors, (365), 278 states have internal predecessors, (365), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-13 06:23:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 467 transitions. [2024-10-13 06:23:57,335 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 467 transitions. Word has length 140 [2024-10-13 06:23:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:57,338 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 467 transitions. [2024-10-13 06:23:57,338 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 467 transitions. [2024-10-13 06:23:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:23:57,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:57,340 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:57,351 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 [2024-10-13 06:23:57,544 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 [2024-10-13 06:23:57,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:57,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -97129337, now seen corresponding path program 1 times [2024-10-13 06:23:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020605721] [2024-10-13 06:23:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:57,550 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 [2024-10-13 06:23:57,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:57,554 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) [2024-10-13 06:23:57,555 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 [2024-10-13 06:23:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:23:57,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:57,903 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 22 treesize of output 18 [2024-10-13 06:23:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:58,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:23:58,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:58,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020605721] [2024-10-13 06:23:58,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020605721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:58,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:58,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:23:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871421872] [2024-10-13 06:23:58,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:58,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:23:58,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:23:58,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:23:58,042 INFO L87 Difference]: Start difference. First operand 338 states and 467 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:58,393 INFO L93 Difference]: Finished difference Result 796 states and 1090 transitions. [2024-10-13 06:23:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:23:58,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-13 06:23:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:58,398 INFO L225 Difference]: With dead ends: 796 [2024-10-13 06:23:58,399 INFO L226 Difference]: Without dead ends: 512 [2024-10-13 06:23:58,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:23:58,400 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 76 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:58,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 794 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:23:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-13 06:23:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 508. [2024-10-13 06:23:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 428 states have (on average 1.2967289719626167) internal successors, (555), 430 states have internal predecessors, (555), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:23:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 689 transitions. [2024-10-13 06:23:58,472 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 689 transitions. Word has length 141 [2024-10-13 06:23:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:58,472 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 689 transitions. [2024-10-13 06:23:58,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 689 transitions. [2024-10-13 06:23:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:23:58,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:58,479 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:58,488 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 [2024-10-13 06:23:58,679 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 [2024-10-13 06:23:58,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -62165819, now seen corresponding path program 1 times [2024-10-13 06:23:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:58,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164727543] [2024-10-13 06:23:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:58,681 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 [2024-10-13 06:23:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:58,685 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) [2024-10-13 06:23:58,687 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 [2024-10-13 06:23:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:23:59,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:23:59,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-13 06:23:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 06:23:59,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:23:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:23:59,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:23:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164727543] [2024-10-13 06:23:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164727543] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:23:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:23:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-13 06:23:59,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241927979] [2024-10-13 06:23:59,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:59,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:23:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:23:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:23:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:23:59,447 INFO L87 Difference]: Start difference. First operand 508 states and 689 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:59,543 INFO L93 Difference]: Finished difference Result 1090 states and 1481 transitions. [2024-10-13 06:23:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:23:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-13 06:23:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:59,550 INFO L225 Difference]: With dead ends: 1090 [2024-10-13 06:23:59,550 INFO L226 Difference]: Without dead ends: 636 [2024-10-13 06:23:59,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:23:59,552 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 160 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:59,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 517 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-13 06:23:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 508. [2024-10-13 06:23:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 428 states have (on average 1.2920560747663552) internal successors, (553), 430 states have internal predecessors, (553), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:23:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 687 transitions. [2024-10-13 06:23:59,580 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 687 transitions. Word has length 141 [2024-10-13 06:23:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:59,580 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 687 transitions. [2024-10-13 06:23:59,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:23:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 687 transitions. [2024-10-13 06:23:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:23:59,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:59,582 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:23:59,595 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 (12)] Forceful destruction successful, exit code 0 [2024-10-13 06:23:59,787 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 [2024-10-13 06:23:59,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1336371715, now seen corresponding path program 1 times [2024-10-13 06:23:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:23:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973735568] [2024-10-13 06:23:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:59,788 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 [2024-10-13 06:23:59,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:23:59,792 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) [2024-10-13 06:23:59,793 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 [2024-10-13 06:24:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:00,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:24:00,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:00,238 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 17 treesize of output 13 [2024-10-13 06:24:00,287 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 54 treesize of output 42 [2024-10-13 06:24:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-10-13 06:24:00,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:00,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:00,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973735568] [2024-10-13 06:24:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973735568] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:00,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:24:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-10-13 06:24:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567904037] [2024-10-13 06:24:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:00,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:24:00,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:00,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:24:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:24:00,445 INFO L87 Difference]: Start difference. First operand 508 states and 687 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:00,632 INFO L93 Difference]: Finished difference Result 954 states and 1295 transitions. [2024-10-13 06:24:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:24:00,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-13 06:24:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:00,636 INFO L225 Difference]: With dead ends: 954 [2024-10-13 06:24:00,637 INFO L226 Difference]: Without dead ends: 500 [2024-10-13 06:24:00,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:24:00,638 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 80 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:00,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 643 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-10-13 06:24:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 492. [2024-10-13 06:24:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 412 states have (on average 1.2936893203883495) internal successors, (533), 414 states have internal predecessors, (533), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:24:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 667 transitions. [2024-10-13 06:24:00,664 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 667 transitions. Word has length 141 [2024-10-13 06:24:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:00,664 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 667 transitions. [2024-10-13 06:24:00,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 667 transitions. [2024-10-13 06:24:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:24:00,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:00,667 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:00,676 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 [2024-10-13 06:24:00,871 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 [2024-10-13 06:24:00,871 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:00,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:00,871 INFO L85 PathProgramCache]: Analyzing trace with hash -993187928, now seen corresponding path program 1 times [2024-10-13 06:24:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:00,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078595519] [2024-10-13 06:24:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:00,872 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 [2024-10-13 06:24:00,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:00,875 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) [2024-10-13 06:24:00,877 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 [2024-10-13 06:24:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:01,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:24:01,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 06:24:01,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:01,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078595519] [2024-10-13 06:24:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078595519] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:24:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-10-13 06:24:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766538569] [2024-10-13 06:24:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:01,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:01,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:01,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:24:01,634 INFO L87 Difference]: Start difference. First operand 492 states and 667 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:01,726 INFO L93 Difference]: Finished difference Result 830 states and 1129 transitions. [2024-10-13 06:24:01,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:01,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2024-10-13 06:24:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:01,729 INFO L225 Difference]: With dead ends: 830 [2024-10-13 06:24:01,730 INFO L226 Difference]: Without dead ends: 608 [2024-10-13 06:24:01,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:24:01,731 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 69 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:01,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 647 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-13 06:24:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 511. [2024-10-13 06:24:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 431 states have (on average 1.3016241299303943) internal successors, (561), 433 states have internal predecessors, (561), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:24:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 695 transitions. [2024-10-13 06:24:01,757 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 695 transitions. Word has length 142 [2024-10-13 06:24:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:01,757 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 695 transitions. [2024-10-13 06:24:01,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 695 transitions. [2024-10-13 06:24:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:24:01,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:01,759 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:01,769 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 (14)] Ended with exit code 0 [2024-10-13 06:24:01,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 [2024-10-13 06:24:01,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:01,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash -570486102, now seen corresponding path program 1 times [2024-10-13 06:24:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:01,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241627422] [2024-10-13 06:24:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:01,965 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 [2024-10-13 06:24:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:01,969 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2024-10-13 06:24:01,970 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 (15)] Waiting until timeout for monitored process [2024-10-13 06:24:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:24:02,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:02,270 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 9 [2024-10-13 06:24:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:02,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:02,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:02,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241627422] [2024-10-13 06:24:02,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241627422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:02,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:02,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:24:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107816776] [2024-10-13 06:24:02,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:02,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:02,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:02,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:02,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:02,427 INFO L87 Difference]: Start difference. First operand 511 states and 695 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:02,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:02,611 INFO L93 Difference]: Finished difference Result 1204 states and 1637 transitions. [2024-10-13 06:24:02,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:02,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2024-10-13 06:24:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:02,619 INFO L225 Difference]: With dead ends: 1204 [2024-10-13 06:24:02,620 INFO L226 Difference]: Without dead ends: 747 [2024-10-13 06:24:02,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:24:02,621 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:02,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 570 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-13 06:24:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 567. [2024-10-13 06:24:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 487 states have (on average 1.3141683778234086) internal successors, (640), 489 states have internal predecessors, (640), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:24:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 774 transitions. [2024-10-13 06:24:02,679 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 774 transitions. Word has length 142 [2024-10-13 06:24:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:02,680 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 774 transitions. [2024-10-13 06:24:02,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 774 transitions. [2024-10-13 06:24:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:24:02,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:02,683 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:02,697 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 (15)] Ended with exit code 0 [2024-10-13 06:24:02,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 [2024-10-13 06:24:02,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1965392716, now seen corresponding path program 1 times [2024-10-13 06:24:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632085624] [2024-10-13 06:24:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:02,890 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 [2024-10-13 06:24:02,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:02,895 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2024-10-13 06:24:02,901 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 (16)] Waiting until timeout for monitored process [2024-10-13 06:24:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 06:24:03,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:03,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:03,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632085624] [2024-10-13 06:24:03,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632085624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:03,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:03,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:24:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760346463] [2024-10-13 06:24:03,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:03,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:24:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:03,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:24:03,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:24:03,236 INFO L87 Difference]: Start difference. First operand 567 states and 774 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:03,334 INFO L93 Difference]: Finished difference Result 1044 states and 1429 transitions. [2024-10-13 06:24:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:24:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-13 06:24:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:03,338 INFO L225 Difference]: With dead ends: 1044 [2024-10-13 06:24:03,338 INFO L226 Difference]: Without dead ends: 575 [2024-10-13 06:24:03,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:24:03,340 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:03,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-13 06:24:03,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2024-10-13 06:24:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 495 states have (on average 1.309090909090909) internal successors, (648), 497 states have internal predecessors, (648), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:24:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 782 transitions. [2024-10-13 06:24:03,368 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 782 transitions. Word has length 143 [2024-10-13 06:24:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:03,368 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 782 transitions. [2024-10-13 06:24:03,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 782 transitions. [2024-10-13 06:24:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:24:03,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:03,370 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:03,379 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 (16)] Ended with exit code 0 [2024-10-13 06:24:03,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 [2024-10-13 06:24:03,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:03,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1675096382, now seen corresponding path program 1 times [2024-10-13 06:24:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:03,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114426471] [2024-10-13 06:24:03,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:03,573 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 [2024-10-13 06:24:03,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:03,577 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2024-10-13 06:24:03,578 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 (17)] Waiting until timeout for monitored process [2024-10-13 06:24:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 06:24:03,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:03,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:03,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114426471] [2024-10-13 06:24:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114426471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:03,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:24:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706410339] [2024-10-13 06:24:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:03,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:24:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:24:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:24:03,936 INFO L87 Difference]: Start difference. First operand 575 states and 782 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:04,068 INFO L93 Difference]: Finished difference Result 1041 states and 1419 transitions. [2024-10-13 06:24:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:24:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-13 06:24:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:04,072 INFO L225 Difference]: With dead ends: 1041 [2024-10-13 06:24:04,073 INFO L226 Difference]: Without dead ends: 579 [2024-10-13 06:24:04,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:24:04,076 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:04,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-13 06:24:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2024-10-13 06:24:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 499 states have (on average 1.3066132264529058) internal successors, (652), 501 states have internal predecessors, (652), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:24:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 786 transitions. [2024-10-13 06:24:04,118 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 786 transitions. Word has length 143 [2024-10-13 06:24:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:04,119 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 786 transitions. [2024-10-13 06:24:04,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 786 transitions. [2024-10-13 06:24:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:24:04,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:04,122 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:04,132 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 (17)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:04,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 [2024-10-13 06:24:04,327 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:04,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2127695607, now seen corresponding path program 1 times [2024-10-13 06:24:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528380911] [2024-10-13 06:24:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:04,329 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 [2024-10-13 06:24:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:04,332 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-10-13 06:24:04,333 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 (18)] Waiting until timeout for monitored process [2024-10-13 06:24:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:24:04,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:05,616 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 9 [2024-10-13 06:24:05,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 06:24:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-13 06:24:05,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:05,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:05,889 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 22 treesize of output 25 [2024-10-13 06:24:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:24:06,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528380911] [2024-10-13 06:24:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528380911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:24:06,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:24:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 06:24:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522747038] [2024-10-13 06:24:06,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:24:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:06,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:24:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:24:06,315 INFO L87 Difference]: Start difference. First operand 579 states and 786 transitions. Second operand has 15 states, 13 states have (on average 9.307692307692308) internal successors, (121), 14 states have internal predecessors, (121), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-13 06:24:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:07,309 INFO L93 Difference]: Finished difference Result 1073 states and 1451 transitions. [2024-10-13 06:24:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:24:07,310 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.307692307692308) internal successors, (121), 14 states have internal predecessors, (121), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 143 [2024-10-13 06:24:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:07,314 INFO L225 Difference]: With dead ends: 1073 [2024-10-13 06:24:07,314 INFO L226 Difference]: Without dead ends: 607 [2024-10-13 06:24:07,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:24:07,316 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 558 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:07,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1166 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:24:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-13 06:24:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 579. [2024-10-13 06:24:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 499 states have (on average 1.3026052104208417) internal successors, (650), 501 states have internal predecessors, (650), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:24:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 784 transitions. [2024-10-13 06:24:07,342 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 784 transitions. Word has length 143 [2024-10-13 06:24:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:07,343 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 784 transitions. [2024-10-13 06:24:07,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.307692307692308) internal successors, (121), 14 states have internal predecessors, (121), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-13 06:24:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 784 transitions. [2024-10-13 06:24:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:24:07,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:07,344 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:07,356 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 (18)] Ended with exit code 0 [2024-10-13 06:24:07,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2024-10-13 06:24:07,549 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:07,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1655620299, now seen corresponding path program 1 times [2024-10-13 06:24:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:07,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349117745] [2024-10-13 06:24:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:07,550 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 [2024-10-13 06:24:07,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:07,554 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-10-13 06:24:07,555 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 (19)] Waiting until timeout for monitored process [2024-10-13 06:24:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:07,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:24:07,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 06:24:08,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:08,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349117745] [2024-10-13 06:24:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349117745] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:08,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:24:08,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-13 06:24:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941259093] [2024-10-13 06:24:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:08,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:08,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:08,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:24:08,225 INFO L87 Difference]: Start difference. First operand 579 states and 784 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:08,310 INFO L93 Difference]: Finished difference Result 963 states and 1299 transitions. [2024-10-13 06:24:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-13 06:24:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:08,315 INFO L225 Difference]: With dead ends: 963 [2024-10-13 06:24:08,315 INFO L226 Difference]: Without dead ends: 699 [2024-10-13 06:24:08,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:24:08,317 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 126 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:08,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 418 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-13 06:24:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 559. [2024-10-13 06:24:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 479 states have (on average 1.292275574112735) internal successors, (619), 481 states have internal predecessors, (619), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-13 06:24:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 753 transitions. [2024-10-13 06:24:08,345 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 753 transitions. Word has length 143 [2024-10-13 06:24:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:08,345 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 753 transitions. [2024-10-13 06:24:08,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 753 transitions. [2024-10-13 06:24:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:08,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:08,347 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:08,356 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 (19)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:08,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2024-10-13 06:24:08,552 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:08,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1072494279, now seen corresponding path program 1 times [2024-10-13 06:24:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:08,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200113747] [2024-10-13 06:24:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:08,554 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 [2024-10-13 06:24:08,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:08,555 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-10-13 06:24:08,558 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 (20)] Waiting until timeout for monitored process [2024-10-13 06:24:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:08,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:24:08,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:09,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:09,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200113747] [2024-10-13 06:24:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200113747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:09,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:09,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:24:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009779962] [2024-10-13 06:24:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:24:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:09,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:24:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:24:09,194 INFO L87 Difference]: Start difference. First operand 559 states and 753 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:09,689 INFO L93 Difference]: Finished difference Result 1148 states and 1541 transitions. [2024-10-13 06:24:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:24:09,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-10-13 06:24:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:09,693 INFO L225 Difference]: With dead ends: 1148 [2024-10-13 06:24:09,693 INFO L226 Difference]: Without dead ends: 684 [2024-10-13 06:24:09,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:24:09,695 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 224 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:09,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 735 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:24:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-10-13 06:24:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 666. [2024-10-13 06:24:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 565 states have (on average 1.2761061946902654) internal successors, (721), 568 states have internal predecessors, (721), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:24:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 889 transitions. [2024-10-13 06:24:09,730 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 889 transitions. Word has length 145 [2024-10-13 06:24:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:09,731 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 889 transitions. [2024-10-13 06:24:09,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 889 transitions. [2024-10-13 06:24:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:09,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:09,732 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:09,742 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 (20)] Ended with exit code 0 [2024-10-13 06:24:09,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 [2024-10-13 06:24:09,933 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:09,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash -425016686, now seen corresponding path program 1 times [2024-10-13 06:24:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997812598] [2024-10-13 06:24:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:09,935 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 [2024-10-13 06:24:09,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:09,936 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2024-10-13 06:24:09,943 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 (21)] Waiting until timeout for monitored process [2024-10-13 06:24:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:10,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 06:24:10,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:10,359 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 12 treesize of output 8 [2024-10-13 06:24:10,420 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 34 treesize of output 22 [2024-10-13 06:24:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:10,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:10,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997812598] [2024-10-13 06:24:10,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997812598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:10,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:10,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:24:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706378361] [2024-10-13 06:24:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:10,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:10,437 INFO L87 Difference]: Start difference. First operand 666 states and 889 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:10,565 INFO L93 Difference]: Finished difference Result 1235 states and 1649 transitions. [2024-10-13 06:24:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-10-13 06:24:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:10,571 INFO L225 Difference]: With dead ends: 1235 [2024-10-13 06:24:10,571 INFO L226 Difference]: Without dead ends: 666 [2024-10-13 06:24:10,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:24:10,573 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 128 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:10,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 743 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-13 06:24:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2024-10-13 06:24:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 565 states have (on average 1.2672566371681415) internal successors, (716), 568 states have internal predecessors, (716), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:24:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 884 transitions. [2024-10-13 06:24:10,620 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 884 transitions. Word has length 145 [2024-10-13 06:24:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:10,621 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 884 transitions. [2024-10-13 06:24:10,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 884 transitions. [2024-10-13 06:24:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:10,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:10,623 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:10,636 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 (21)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:10,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 [2024-10-13 06:24:10,824 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:10,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -482334570, now seen corresponding path program 1 times [2024-10-13 06:24:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667505678] [2024-10-13 06:24:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:10,828 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 [2024-10-13 06:24:10,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:10,831 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2024-10-13 06:24:10,832 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 (22)] Waiting until timeout for monitored process [2024-10-13 06:24:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:24:11,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:11,594 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 17 treesize of output 13 [2024-10-13 06:24:11,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2024-10-13 06:24:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:24:11,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:11,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:11,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667505678] [2024-10-13 06:24:11,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667505678] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:11,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:24:11,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-10-13 06:24:11,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869042881] [2024-10-13 06:24:11,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:11,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:11,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:11,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:11,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:24:11,810 INFO L87 Difference]: Start difference. First operand 666 states and 884 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:11,931 INFO L93 Difference]: Finished difference Result 690 states and 909 transitions. [2024-10-13 06:24:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:11,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-10-13 06:24:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:11,940 INFO L225 Difference]: With dead ends: 690 [2024-10-13 06:24:11,943 INFO L226 Difference]: Without dead ends: 688 [2024-10-13 06:24:11,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:24:11,945 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 98 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:11,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 671 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:24:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-10-13 06:24:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2024-10-13 06:24:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 579 states have (on average 1.2607944732297063) internal successors, (730), 582 states have internal predecessors, (730), 82 states have call successors, (82), 18 states have call predecessors, (82), 18 states have return successors, (82), 79 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 06:24:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 894 transitions. [2024-10-13 06:24:12,039 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 894 transitions. Word has length 145 [2024-10-13 06:24:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:12,040 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 894 transitions. [2024-10-13 06:24:12,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 894 transitions. [2024-10-13 06:24:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:12,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:12,041 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:12,052 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 (22)] Ended with exit code 0 [2024-10-13 06:24:12,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 [2024-10-13 06:24:12,242 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash -482274988, now seen corresponding path program 1 times [2024-10-13 06:24:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:12,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262401437] [2024-10-13 06:24:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:12,244 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 [2024-10-13 06:24:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:12,247 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2024-10-13 06:24:12,249 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 (23)] Waiting until timeout for monitored process [2024-10-13 06:24:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 06:24:12,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:13,458 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 [2024-10-13 06:24:13,745 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 125 treesize of output 89 [2024-10-13 06:24:13,748 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 137 treesize of output 77 [2024-10-13 06:24:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-13 06:24:13,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:13,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262401437] [2024-10-13 06:24:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262401437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [269019278] [2024-10-13 06:24:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:13,976 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:24:13,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:24:13,979 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:24:13,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-13 06:24:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:14,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 06:24:15,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:16,022 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 [2024-10-13 06:24:16,667 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 [2024-10-13 06:24:17,144 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 125 treesize of output 89 [2024-10-13 06:24:17,147 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 137 treesize of output 77 [2024-10-13 06:24:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-13 06:24:17,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [269019278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:17,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:24:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-13 06:24:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404717414] [2024-10-13 06:24:17,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:17,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 06:24:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:17,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 06:24:17,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:24:17,327 INFO L87 Difference]: Start difference. First operand 680 states and 894 transitions. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 15 states have internal predecessors, (127), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-13 06:24:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:18,686 INFO L93 Difference]: Finished difference Result 1905 states and 2492 transitions. [2024-10-13 06:24:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:24:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 15 states have internal predecessors, (127), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 145 [2024-10-13 06:24:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:18,697 INFO L225 Difference]: With dead ends: 1905 [2024-10-13 06:24:18,697 INFO L226 Difference]: Without dead ends: 1322 [2024-10-13 06:24:18,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-10-13 06:24:18,700 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 399 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:18,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1460 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:24:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2024-10-13 06:24:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1312. [2024-10-13 06:24:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1126 states have (on average 1.2566607460035524) internal successors, (1415), 1134 states have internal predecessors, (1415), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-10-13 06:24:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1713 transitions. [2024-10-13 06:24:18,803 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1713 transitions. Word has length 145 [2024-10-13 06:24:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:18,804 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1713 transitions. [2024-10-13 06:24:18,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 15 states have internal predecessors, (127), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-13 06:24:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1713 transitions. [2024-10-13 06:24:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:18,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:18,806 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:18,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2024-10-13 06:24:19,017 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 (23)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:19,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /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 [2024-10-13 06:24:19,209 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:19,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1234363312, now seen corresponding path program 1 times [2024-10-13 06:24:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:19,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207309157] [2024-10-13 06:24:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:19,211 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 [2024-10-13 06:24:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:19,214 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2024-10-13 06:24:19,215 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 (25)] Waiting until timeout for monitored process [2024-10-13 06:24:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:19,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 06:24:19,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:19,763 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 18 treesize of output 14 [2024-10-13 06:24:19,915 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 14 [2024-10-13 06:24:19,934 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 [2024-10-13 06:24:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:19,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:19,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207309157] [2024-10-13 06:24:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207309157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:24:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034666336] [2024-10-13 06:24:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:19,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:24:19,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:24:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:24:19,975 INFO L87 Difference]: Start difference. First operand 1312 states and 1713 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:20,834 INFO L93 Difference]: Finished difference Result 3238 states and 4205 transitions. [2024-10-13 06:24:20,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:24:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-10-13 06:24:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:20,846 INFO L225 Difference]: With dead ends: 3238 [2024-10-13 06:24:20,846 INFO L226 Difference]: Without dead ends: 2079 [2024-10-13 06:24:20,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:24:20,851 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 215 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:20,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1535 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:24:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-10-13 06:24:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1626. [2024-10-13 06:24:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1440 states have (on average 1.26875) internal successors, (1827), 1448 states have internal predecessors, (1827), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-10-13 06:24:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2125 transitions. [2024-10-13 06:24:21,013 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2125 transitions. Word has length 145 [2024-10-13 06:24:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:21,014 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2125 transitions. [2024-10-13 06:24:21,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2125 transitions. [2024-10-13 06:24:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:21,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:21,016 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:21,026 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 (25)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:21,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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 [2024-10-13 06:24:21,221 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:21,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash -976197874, now seen corresponding path program 1 times [2024-10-13 06:24:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:21,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625543806] [2024-10-13 06:24:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:21,224 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 [2024-10-13 06:24:21,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:21,225 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2024-10-13 06:24:21,227 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 (26)] Waiting until timeout for monitored process [2024-10-13 06:24:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:21,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:24:21,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:22,025 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 9 [2024-10-13 06:24:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:22,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:22,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625543806] [2024-10-13 06:24:22,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625543806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:22,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:22,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:24:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170854162] [2024-10-13 06:24:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:22,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:22,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:22,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:22,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:22,041 INFO L87 Difference]: Start difference. First operand 1626 states and 2125 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:22,267 INFO L93 Difference]: Finished difference Result 3087 states and 4034 transitions. [2024-10-13 06:24:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-10-13 06:24:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:22,275 INFO L225 Difference]: With dead ends: 3087 [2024-10-13 06:24:22,276 INFO L226 Difference]: Without dead ends: 1644 [2024-10-13 06:24:22,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:22,280 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 62 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:22,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 412 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-10-13 06:24:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1626. [2024-10-13 06:24:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1440 states have (on average 1.2604166666666667) internal successors, (1815), 1448 states have internal predecessors, (1815), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-10-13 06:24:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2113 transitions. [2024-10-13 06:24:22,482 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2113 transitions. Word has length 145 [2024-10-13 06:24:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:22,483 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2113 transitions. [2024-10-13 06:24:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2113 transitions. [2024-10-13 06:24:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:22,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:22,486 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:22,496 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 (26)] Ended with exit code 0 [2024-10-13 06:24:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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 [2024-10-13 06:24:22,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 376060423, now seen corresponding path program 1 times [2024-10-13 06:24:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923947107] [2024-10-13 06:24:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:22,692 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 [2024-10-13 06:24:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:22,698 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2024-10-13 06:24:22,700 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 (27)] Waiting until timeout for monitored process [2024-10-13 06:24:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:23,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:24:23,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:23,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:23,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923947107] [2024-10-13 06:24:23,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923947107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:23,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:23,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:24:23,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208240893] [2024-10-13 06:24:23,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:24:23,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:23,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:24:23,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:24:23,466 INFO L87 Difference]: Start difference. First operand 1626 states and 2113 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:24,041 INFO L93 Difference]: Finished difference Result 3114 states and 4048 transitions. [2024-10-13 06:24:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:24:24,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-10-13 06:24:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:24,049 INFO L225 Difference]: With dead ends: 3114 [2024-10-13 06:24:24,050 INFO L226 Difference]: Without dead ends: 1671 [2024-10-13 06:24:24,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:24:24,053 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 200 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:24,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 662 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:24:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-13 06:24:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1618. [2024-10-13 06:24:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1432 states have (on average 1.2562849162011174) internal successors, (1799), 1440 states have internal predecessors, (1799), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-10-13 06:24:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2097 transitions. [2024-10-13 06:24:24,202 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2097 transitions. Word has length 145 [2024-10-13 06:24:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:24,202 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2097 transitions. [2024-10-13 06:24:24,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2097 transitions. [2024-10-13 06:24:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:24,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:24,204 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:24,218 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 (27)] Ended with exit code 0 [2024-10-13 06:24:24,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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 [2024-10-13 06:24:24,410 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash -959603698, now seen corresponding path program 1 times [2024-10-13 06:24:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341698394] [2024-10-13 06:24:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:24,412 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 [2024-10-13 06:24:24,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:24,417 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2024-10-13 06:24:24,418 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 (28)] Waiting until timeout for monitored process [2024-10-13 06:24:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:24,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:24:24,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:24,945 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 9 [2024-10-13 06:24:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:24:24,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:24,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341698394] [2024-10-13 06:24:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341698394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:24:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092703964] [2024-10-13 06:24:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:24,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:24,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:24,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:24,956 INFO L87 Difference]: Start difference. First operand 1618 states and 2097 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:25,146 INFO L93 Difference]: Finished difference Result 2803 states and 3624 transitions. [2024-10-13 06:24:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:25,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-10-13 06:24:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:25,154 INFO L225 Difference]: With dead ends: 2803 [2024-10-13 06:24:25,154 INFO L226 Difference]: Without dead ends: 1338 [2024-10-13 06:24:25,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:25,159 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 81 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:25,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 425 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-10-13 06:24:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1320. [2024-10-13 06:24:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1134 states have (on average 1.2354497354497354) internal successors, (1401), 1142 states have internal predecessors, (1401), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-10-13 06:24:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1699 transitions. [2024-10-13 06:24:25,304 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1699 transitions. Word has length 145 [2024-10-13 06:24:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:25,304 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1699 transitions. [2024-10-13 06:24:25,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:24:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1699 transitions. [2024-10-13 06:24:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:24:25,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:25,306 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:25,318 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 (28)] Ended with exit code 0 [2024-10-13 06:24:25,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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 [2024-10-13 06:24:25,507 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:25,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash -522376308, now seen corresponding path program 1 times [2024-10-13 06:24:25,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:25,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26602298] [2024-10-13 06:24:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:25,509 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 [2024-10-13 06:24:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:25,513 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2024-10-13 06:24:25,525 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 (29)] Waiting until timeout for monitored process [2024-10-13 06:24:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:25,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 06:24:25,871 INFO L278 TraceCheckSpWp]: Computing forward predicates...