./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.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 e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:31:31,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:31:31,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:31:31,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:31:31,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:31:31,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:31:31,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:31:31,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:31:31,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:31:31,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:31:31,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:31:31,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:31:31,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:31:31,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:31:31,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:31:31,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:31:31,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:31:31,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:31:31,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:31:31,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:31:31,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:31:31,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:31:31,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:31:31,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:31:31,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:31:31,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:31:31,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:31:31,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:31:31,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:31:31,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:31:31,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:31:31,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:31:31,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:31:31,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:31:31,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:31:31,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:31:31,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:31:31,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:31:31,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:31:31,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:31:31,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:31:31,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:31:31,807 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 -> e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf [2024-11-16 18:31:32,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:31:32,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:31:32,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:31:32,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:31:32,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:31:32,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-11-16 18:31:33,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:31:33,801 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:31:33,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-11-16 18:31:33,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468c35c0f/a4c8c192dbc148c79081c53b45344502/FLAG7b85a1a86 [2024-11-16 18:31:34,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468c35c0f/a4c8c192dbc148c79081c53b45344502 [2024-11-16 18:31:34,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:31:34,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:31:34,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:31:34,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:31:34,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:31:34,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a650e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34, skipping insertion in model container [2024-11-16 18:31:34,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:31:34,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i[916,929] [2024-11-16 18:31:34,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:31:34,438 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:31:34,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i[916,929] [2024-11-16 18:31:34,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:31:34,492 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:31:34,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34 WrapperNode [2024-11-16 18:31:34,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:31:34,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:31:34,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:31:34,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:31:34,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,558 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2024-11-16 18:31:34,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:31:34,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:31:34,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:31:34,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:31:34,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,598 INFO L175 MemorySlicer]: Split 96 memory accesses to 11 slices as follows [2, 8, 8, 17, 16, 3, 8, 10, 8, 8, 8]. 18 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1]. [2024-11-16 18:31:34,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:31:34,646 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:31:34,646 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:31:34,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:31:34,647 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (1/1) ... [2024-11-16 18:31:34,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:31:34,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:31:34,694 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-11-16 18:31:34,701 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-11-16 18:31:34,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:31:34,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:31:34,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:31:34,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-16 18:31:34,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-16 18:31:34,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-16 18:31:34,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-16 18:31:34,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-16 18:31:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-16 18:31:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-16 18:31:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-16 18:31:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-16 18:31:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:31:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:31:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 18:31:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 18:31:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 18:31:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 18:31:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-16 18:31:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-16 18:31:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-16 18:31:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-16 18:31:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-16 18:31:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:31:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:31:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-16 18:31:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:31:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:31:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 18:31:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 18:31:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 18:31:34,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-16 18:31:34,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:31:34,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:31:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 18:31:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 18:31:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 18:31:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 18:31:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-16 18:31:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-16 18:31:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-16 18:31:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-16 18:31:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-16 18:31:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:31:34,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:31:34,980 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:31:34,982 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:31:35,378 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem68#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem70#1;havoc property_#t~mem74#1;havoc property_#t~ite81#1;havoc property_#t~mem75#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~short82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~bitwise92#1;havoc property_#t~ite107#1;havoc property_#t~mem102#1;havoc property_#t~mem93#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2024-11-16 18:31:35,422 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-16 18:31:35,422 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:31:35,439 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:31:35,440 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:31:35,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:31:35 BoogieIcfgContainer [2024-11-16 18:31:35,442 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:31:35,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:31:35,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:31:35,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:31:35,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:31:34" (1/3) ... [2024-11-16 18:31:35,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f02097b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:31:35, skipping insertion in model container [2024-11-16 18:31:35,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:34" (2/3) ... [2024-11-16 18:31:35,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f02097b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:31:35, skipping insertion in model container [2024-11-16 18:31:35,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:31:35" (3/3) ... [2024-11-16 18:31:35,450 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2024-11-16 18:31:35,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:31:35,463 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:31:35,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:31:35,532 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;@2c4aba86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:31:35,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:31:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:31:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 18:31:35,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:35,550 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:35,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:35,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1362104905, now seen corresponding path program 1 times [2024-11-16 18:31:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617270634] [2024-11-16 18:31:35,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:35,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617270634] [2024-11-16 18:31:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617270634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:35,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:35,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:31:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163617652] [2024-11-16 18:31:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:36,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:31:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:36,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:31:36,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:31:36,031 INFO L87 Difference]: Start difference. First operand has 108 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:31:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:36,072 INFO L93 Difference]: Finished difference Result 208 states and 316 transitions. [2024-11-16 18:31:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:31:36,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-16 18:31:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:36,082 INFO L225 Difference]: With dead ends: 208 [2024-11-16 18:31:36,083 INFO L226 Difference]: Without dead ends: 103 [2024-11-16 18:31:36,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-11-16 18:31:36,091 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:36,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:31:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-16 18:31:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-16 18:31:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:31:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-16 18:31:36,135 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 92 [2024-11-16 18:31:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:36,136 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-16 18:31:36,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:31:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-16 18:31:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 18:31:36,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:36,140 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:31:36,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2117299752, now seen corresponding path program 1 times [2024-11-16 18:31:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:36,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228027000] [2024-11-16 18:31:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228027000] [2024-11-16 18:31:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228027000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:31:37,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774961014] [2024-11-16 18:31:37,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:37,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:31:37,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:37,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:31:37,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:31:37,106 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:38,091 INFO L93 Difference]: Finished difference Result 511 states and 737 transitions. [2024-11-16 18:31:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:31:38,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-16 18:31:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:38,099 INFO L225 Difference]: With dead ends: 511 [2024-11-16 18:31:38,102 INFO L226 Difference]: Without dead ends: 411 [2024-11-16 18:31:38,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:31:38,106 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 368 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:38,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 950 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 18:31:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-16 18:31:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 286. [2024-11-16 18:31:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 255 states have (on average 1.411764705882353) internal successors, (360), 255 states have internal predecessors, (360), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 414 transitions. [2024-11-16 18:31:38,175 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 414 transitions. Word has length 92 [2024-11-16 18:31:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:38,176 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 414 transitions. [2024-11-16 18:31:38,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 414 transitions. [2024-11-16 18:31:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 18:31:38,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:38,182 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:38,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:31:38,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:38,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2121166108, now seen corresponding path program 1 times [2024-11-16 18:31:38,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:38,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686054900] [2024-11-16 18:31:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:38,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:38,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:38,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686054900] [2024-11-16 18:31:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686054900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:38,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:31:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948856281] [2024-11-16 18:31:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:38,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:31:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:31:38,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:31:38,391 INFO L87 Difference]: Start difference. First operand 286 states and 414 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:38,427 INFO L93 Difference]: Finished difference Result 587 states and 853 transitions. [2024-11-16 18:31:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:31:38,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-16 18:31:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:38,430 INFO L225 Difference]: With dead ends: 587 [2024-11-16 18:31:38,430 INFO L226 Difference]: Without dead ends: 304 [2024-11-16 18:31:38,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-11-16 18:31:38,434 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:38,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 282 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:31:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-16 18:31:38,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 203. [2024-11-16 18:31:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.401098901098901) internal successors, (255), 182 states have internal predecessors, (255), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:31:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2024-11-16 18:31:38,465 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 93 [2024-11-16 18:31:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:38,465 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2024-11-16 18:31:38,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2024-11-16 18:31:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:31:38,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:38,469 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:38,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:31:38,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:38,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2091407468, now seen corresponding path program 1 times [2024-11-16 18:31:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:38,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129247283] [2024-11-16 18:31:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129247283] [2024-11-16 18:31:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129247283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:31:38,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63945973] [2024-11-16 18:31:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:38,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:31:38,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:38,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:31:38,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:31:38,580 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:38,639 INFO L93 Difference]: Finished difference Result 364 states and 521 transitions. [2024-11-16 18:31:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:31:38,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-16 18:31:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:38,641 INFO L225 Difference]: With dead ends: 364 [2024-11-16 18:31:38,641 INFO L226 Difference]: Without dead ends: 164 [2024-11-16 18:31:38,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-11-16 18:31:38,643 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 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.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:38,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:31:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-16 18:31:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2024-11-16 18:31:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 129 states have internal predecessors, (176), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:31:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 212 transitions. [2024-11-16 18:31:38,658 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 212 transitions. Word has length 94 [2024-11-16 18:31:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:38,658 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 212 transitions. [2024-11-16 18:31:38,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 212 transitions. [2024-11-16 18:31:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 18:31:38,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:38,660 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:31:38,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 453266943, now seen corresponding path program 1 times [2024-11-16 18:31:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846448313] [2024-11-16 18:31:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:39,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:39,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846448313] [2024-11-16 18:31:39,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846448313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:39,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:39,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:31:39,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593718997] [2024-11-16 18:31:39,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:39,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:31:39,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:39,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:31:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:31:39,584 INFO L87 Difference]: Start difference. First operand 150 states and 212 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:40,062 INFO L93 Difference]: Finished difference Result 601 states and 851 transitions. [2024-11-16 18:31:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:31:40,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-16 18:31:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:40,067 INFO L225 Difference]: With dead ends: 601 [2024-11-16 18:31:40,067 INFO L226 Difference]: Without dead ends: 502 [2024-11-16 18:31:40,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:31:40,068 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 583 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:40,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 2000 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:31:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-16 18:31:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 269. [2024-11-16 18:31:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 383 transitions. [2024-11-16 18:31:40,090 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 383 transitions. Word has length 97 [2024-11-16 18:31:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:40,090 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 383 transitions. [2024-11-16 18:31:40,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 383 transitions. [2024-11-16 18:31:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 18:31:40,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:40,095 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:40,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:31:40,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:40,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 706716325, now seen corresponding path program 1 times [2024-11-16 18:31:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641031610] [2024-11-16 18:31:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:40,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641031610] [2024-11-16 18:31:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641031610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:40,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:40,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:31:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262255416] [2024-11-16 18:31:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:40,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:31:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:31:40,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:31:40,532 INFO L87 Difference]: Start difference. First operand 269 states and 383 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:40,998 INFO L93 Difference]: Finished difference Result 714 states and 1018 transitions. [2024-11-16 18:31:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:31:40,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-16 18:31:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:41,002 INFO L225 Difference]: With dead ends: 714 [2024-11-16 18:31:41,002 INFO L226 Difference]: Without dead ends: 499 [2024-11-16 18:31:41,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:31:41,005 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 249 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:41,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 844 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:31:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-16 18:31:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 279. [2024-11-16 18:31:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 248 states have (on average 1.3790322580645162) internal successors, (342), 248 states have internal predecessors, (342), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 396 transitions. [2024-11-16 18:31:41,028 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 396 transitions. Word has length 98 [2024-11-16 18:31:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:41,029 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 396 transitions. [2024-11-16 18:31:41,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 396 transitions. [2024-11-16 18:31:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 18:31:41,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:41,030 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:41,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:31:41,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:41,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash 737736132, now seen corresponding path program 1 times [2024-11-16 18:31:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:41,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848511460] [2024-11-16 18:31:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848511460] [2024-11-16 18:31:41,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848511460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:41,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:41,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:31:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788478730] [2024-11-16 18:31:41,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:41,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:31:41,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:41,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:31:41,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:31:41,916 INFO L87 Difference]: Start difference. First operand 279 states and 396 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:42,661 INFO L93 Difference]: Finished difference Result 809 states and 1150 transitions. [2024-11-16 18:31:42,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:31:42,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-16 18:31:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:42,664 INFO L225 Difference]: With dead ends: 809 [2024-11-16 18:31:42,665 INFO L226 Difference]: Without dead ends: 594 [2024-11-16 18:31:42,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:31:42,666 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 376 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:42,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 994 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:31:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-16 18:31:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 291. [2024-11-16 18:31:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 260 states have (on average 1.376923076923077) internal successors, (358), 260 states have internal predecessors, (358), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 412 transitions. [2024-11-16 18:31:42,686 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 412 transitions. Word has length 98 [2024-11-16 18:31:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:42,686 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 412 transitions. [2024-11-16 18:31:42,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 412 transitions. [2024-11-16 18:31:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 18:31:42,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:42,688 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:42,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:31:42,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:42,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:42,689 INFO L85 PathProgramCache]: Analyzing trace with hash -106735739, now seen corresponding path program 1 times [2024-11-16 18:31:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:42,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653254183] [2024-11-16 18:31:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653254183] [2024-11-16 18:31:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653254183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:43,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:31:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494956806] [2024-11-16 18:31:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:43,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:31:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:31:43,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:31:43,310 INFO L87 Difference]: Start difference. First operand 291 states and 412 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:43,941 INFO L93 Difference]: Finished difference Result 704 states and 999 transitions. [2024-11-16 18:31:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:31:43,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-16 18:31:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:43,945 INFO L225 Difference]: With dead ends: 704 [2024-11-16 18:31:43,945 INFO L226 Difference]: Without dead ends: 485 [2024-11-16 18:31:43,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:31:43,947 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 286 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:43,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 879 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:31:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-16 18:31:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 279. [2024-11-16 18:31:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 248 states have (on average 1.3790322580645162) internal successors, (342), 248 states have internal predecessors, (342), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 396 transitions. [2024-11-16 18:31:43,968 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 396 transitions. Word has length 98 [2024-11-16 18:31:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:43,969 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 396 transitions. [2024-11-16 18:31:43,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 396 transitions. [2024-11-16 18:31:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 18:31:43,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:43,970 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:43,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:31:43,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1221187611, now seen corresponding path program 1 times [2024-11-16 18:31:43,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:43,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127570890] [2024-11-16 18:31:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127570890] [2024-11-16 18:31:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127570890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:44,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:44,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:31:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737077657] [2024-11-16 18:31:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:44,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:31:44,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:31:44,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:31:44,525 INFO L87 Difference]: Start difference. First operand 279 states and 396 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:44,751 INFO L93 Difference]: Finished difference Result 630 states and 893 transitions. [2024-11-16 18:31:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:31:44,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-16 18:31:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:44,754 INFO L225 Difference]: With dead ends: 630 [2024-11-16 18:31:44,754 INFO L226 Difference]: Without dead ends: 411 [2024-11-16 18:31:44,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:31:44,756 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 398 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:44,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1157 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:31:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-16 18:31:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 274. [2024-11-16 18:31:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 243 states have (on average 1.3703703703703705) internal successors, (333), 243 states have internal predecessors, (333), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 387 transitions. [2024-11-16 18:31:44,773 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 387 transitions. Word has length 98 [2024-11-16 18:31:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:44,773 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 387 transitions. [2024-11-16 18:31:44,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 387 transitions. [2024-11-16 18:31:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 18:31:44,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:44,774 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:44,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:31:44,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:44,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash 565079626, now seen corresponding path program 1 times [2024-11-16 18:31:44,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:44,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381958912] [2024-11-16 18:31:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:31:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381958912] [2024-11-16 18:31:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381958912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:31:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294228568] [2024-11-16 18:31:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:45,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:31:45,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:31:45,550 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-11-16 18:31:45,552 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-11-16 18:31:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:45,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 18:31:45,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:31:46,009 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 11 treesize of output 7 [2024-11-16 18:31:46,038 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 11 treesize of output 9 [2024-11-16 18:31:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:31:46,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:31:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:46,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294228568] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:31:46,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:31:46,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 10] total 21 [2024-11-16 18:31:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113032990] [2024-11-16 18:31:46,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:46,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:31:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:46,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:31:46,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-16 18:31:46,488 INFO L87 Difference]: Start difference. First operand 274 states and 387 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:46,637 INFO L93 Difference]: Finished difference Result 473 states and 669 transitions. [2024-11-16 18:31:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:31:46,638 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-16 18:31:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:46,642 INFO L225 Difference]: With dead ends: 473 [2024-11-16 18:31:46,642 INFO L226 Difference]: Without dead ends: 374 [2024-11-16 18:31:46,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-11-16 18:31:46,644 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 125 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:46,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 694 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:31:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-16 18:31:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 276. [2024-11-16 18:31:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 245 states have (on average 1.3673469387755102) internal successors, (335), 245 states have internal predecessors, (335), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 389 transitions. [2024-11-16 18:31:46,664 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 389 transitions. Word has length 99 [2024-11-16 18:31:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:46,664 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 389 transitions. [2024-11-16 18:31:46,665 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 389 transitions. [2024-11-16 18:31:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 18:31:46,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:46,666 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:46,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:31:46,867 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,SelfDestructingSolverStorable9 [2024-11-16 18:31:46,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1023916669, now seen corresponding path program 1 times [2024-11-16 18:31:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:46,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843079859] [2024-11-16 18:31:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:46,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:47,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:47,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843079859] [2024-11-16 18:31:47,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843079859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:47,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:47,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:31:47,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546228807] [2024-11-16 18:31:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:47,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:31:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:31:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:31:47,026 INFO L87 Difference]: Start difference. First operand 276 states and 389 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:47,063 INFO L93 Difference]: Finished difference Result 496 states and 703 transitions. [2024-11-16 18:31:47,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:31:47,064 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-16 18:31:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:47,066 INFO L225 Difference]: With dead ends: 496 [2024-11-16 18:31:47,066 INFO L226 Difference]: Without dead ends: 282 [2024-11-16 18:31:47,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-11-16 18:31:47,067 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:47,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:31:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-16 18:31:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2024-11-16 18:31:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3614457831325302) internal successors, (339), 249 states have internal predecessors, (339), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 393 transitions. [2024-11-16 18:31:47,088 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 393 transitions. Word has length 99 [2024-11-16 18:31:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:47,088 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 393 transitions. [2024-11-16 18:31:47,088 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 393 transitions. [2024-11-16 18:31:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 18:31:47,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:47,090 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:47,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:31:47,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:47,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1317319676, now seen corresponding path program 1 times [2024-11-16 18:31:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:47,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982677549] [2024-11-16 18:31:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:47,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:47,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982677549] [2024-11-16 18:31:47,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982677549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:47,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:47,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:31:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30254821] [2024-11-16 18:31:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:47,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:31:47,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:47,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:31:47,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:31:47,612 INFO L87 Difference]: Start difference. First operand 280 states and 393 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:47,844 INFO L93 Difference]: Finished difference Result 565 states and 792 transitions. [2024-11-16 18:31:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:31:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-16 18:31:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:47,847 INFO L225 Difference]: With dead ends: 565 [2024-11-16 18:31:47,847 INFO L226 Difference]: Without dead ends: 448 [2024-11-16 18:31:47,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:31:47,848 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 413 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:47,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1051 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:31:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-16 18:31:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 295. [2024-11-16 18:31:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 264 states have (on average 1.3636363636363635) internal successors, (360), 264 states have internal predecessors, (360), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 414 transitions. [2024-11-16 18:31:47,865 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 414 transitions. Word has length 99 [2024-11-16 18:31:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:47,865 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 414 transitions. [2024-11-16 18:31:47,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 414 transitions. [2024-11-16 18:31:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 18:31:47,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:47,866 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:47,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:31:47,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:47,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2131722815, now seen corresponding path program 1 times [2024-11-16 18:31:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109425015] [2024-11-16 18:31:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:48,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:48,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109425015] [2024-11-16 18:31:48,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109425015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:48,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:48,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:31:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297612157] [2024-11-16 18:31:48,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:48,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:31:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:48,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:31:48,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:31:48,468 INFO L87 Difference]: Start difference. First operand 295 states and 414 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:48,743 INFO L93 Difference]: Finished difference Result 525 states and 733 transitions. [2024-11-16 18:31:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:31:48,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-16 18:31:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:48,746 INFO L225 Difference]: With dead ends: 525 [2024-11-16 18:31:48,746 INFO L226 Difference]: Without dead ends: 408 [2024-11-16 18:31:48,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:31:48,747 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 281 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:48,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1371 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:31:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-16 18:31:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 301. [2024-11-16 18:31:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 270 states have (on average 1.3592592592592592) internal successors, (367), 270 states have internal predecessors, (367), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2024-11-16 18:31:48,765 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 99 [2024-11-16 18:31:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:48,765 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2024-11-16 18:31:48,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2024-11-16 18:31:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:31:48,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:48,766 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:48,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:31:48,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1681455784, now seen corresponding path program 1 times [2024-11-16 18:31:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571891431] [2024-11-16 18:31:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:48,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571891431] [2024-11-16 18:31:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571891431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:31:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544157196] [2024-11-16 18:31:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:48,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:31:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:48,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:31:48,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:31:48,991 INFO L87 Difference]: Start difference. First operand 301 states and 421 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:49,063 INFO L93 Difference]: Finished difference Result 493 states and 692 transitions. [2024-11-16 18:31:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:31:49,064 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-16 18:31:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:49,066 INFO L225 Difference]: With dead ends: 493 [2024-11-16 18:31:49,066 INFO L226 Difference]: Without dead ends: 374 [2024-11-16 18:31:49,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-11-16 18:31:49,067 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 80 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:49,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 630 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:31:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-16 18:31:49,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 302. [2024-11-16 18:31:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 271 states have (on average 1.3542435424354244) internal successors, (367), 271 states have internal predecessors, (367), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:31:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 421 transitions. [2024-11-16 18:31:49,090 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 421 transitions. Word has length 100 [2024-11-16 18:31:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:49,091 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 421 transitions. [2024-11-16 18:31:49,091 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 421 transitions. [2024-11-16 18:31:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:31:49,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:49,093 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:49,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:31:49,094 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1614449031, now seen corresponding path program 1 times [2024-11-16 18:31:49,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:49,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712702195] [2024-11-16 18:31:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:49,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:49,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712702195] [2024-11-16 18:31:49,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712702195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:49,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:49,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:31:49,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465406894] [2024-11-16 18:31:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:49,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:31:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:31:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:31:49,293 INFO L87 Difference]: Start difference. First operand 302 states and 421 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:49,310 INFO L93 Difference]: Finished difference Result 423 states and 589 transitions. [2024-11-16 18:31:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:31:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-16 18:31:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:49,311 INFO L225 Difference]: With dead ends: 423 [2024-11-16 18:31:49,311 INFO L226 Difference]: Without dead ends: 178 [2024-11-16 18:31:49,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-11-16 18:31:49,312 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:49,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:31:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-16 18:31:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-11-16 18:31:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 155 states have internal predecessors, (204), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:31:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 240 transitions. [2024-11-16 18:31:49,325 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 240 transitions. Word has length 100 [2024-11-16 18:31:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:49,325 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 240 transitions. [2024-11-16 18:31:49,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 240 transitions. [2024-11-16 18:31:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:31:49,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:49,327 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:49,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 18:31:49,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:49,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1395125639, now seen corresponding path program 1 times [2024-11-16 18:31:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:49,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169767344] [2024-11-16 18:31:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:49,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:49,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169767344] [2024-11-16 18:31:49,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169767344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:49,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:31:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545121879] [2024-11-16 18:31:49,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:49,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:31:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:31:49,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:31:49,539 INFO L87 Difference]: Start difference. First operand 176 states and 240 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:49,595 INFO L93 Difference]: Finished difference Result 333 states and 457 transitions. [2024-11-16 18:31:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:31:49,596 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-16 18:31:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:49,597 INFO L225 Difference]: With dead ends: 333 [2024-11-16 18:31:49,597 INFO L226 Difference]: Without dead ends: 232 [2024-11-16 18:31:49,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-11-16 18:31:49,598 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 64 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 621 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-11-16 18:31:49,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 621 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:31:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-16 18:31:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2024-11-16 18:31:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.323699421965318) internal successors, (229), 173 states have internal predecessors, (229), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:31:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 265 transitions. [2024-11-16 18:31:49,613 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 265 transitions. Word has length 101 [2024-11-16 18:31:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:49,614 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 265 transitions. [2024-11-16 18:31:49,614 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 265 transitions. [2024-11-16 18:31:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:31:49,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:49,615 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:49,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 18:31:49,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:49,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2053916852, now seen corresponding path program 1 times [2024-11-16 18:31:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:49,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568832005] [2024-11-16 18:31:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:31:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:49,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568832005] [2024-11-16 18:31:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568832005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:49,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:49,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:31:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723941300] [2024-11-16 18:31:49,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:49,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:31:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:31:49,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:31:49,832 INFO L87 Difference]: Start difference. First operand 194 states and 265 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:49,890 INFO L93 Difference]: Finished difference Result 351 states and 481 transitions. [2024-11-16 18:31:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:31:49,891 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-16 18:31:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:49,892 INFO L225 Difference]: With dead ends: 351 [2024-11-16 18:31:49,892 INFO L226 Difference]: Without dead ends: 232 [2024-11-16 18:31:49,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-11-16 18:31:49,893 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 61 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:49,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 704 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:31:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-16 18:31:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 198. [2024-11-16 18:31:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 177 states have (on average 1.3163841807909604) internal successors, (233), 177 states have internal predecessors, (233), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:31:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 269 transitions. [2024-11-16 18:31:49,904 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 269 transitions. Word has length 101 [2024-11-16 18:31:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:49,905 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 269 transitions. [2024-11-16 18:31:49,905 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:31:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 269 transitions. [2024-11-16 18:31:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:31:49,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:49,906 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:49,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 18:31:49,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:49,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash 755319299, now seen corresponding path program 1 times [2024-11-16 18:31:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356193207] [2024-11-16 18:31:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-16 18:31:50,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356193207] [2024-11-16 18:31:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356193207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:31:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:31:50,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:31:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031841671] [2024-11-16 18:31:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:31:50,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:31:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:31:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:31:50,796 INFO L87 Difference]: Start difference. First operand 198 states and 269 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:31:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:51,703 INFO L93 Difference]: Finished difference Result 399 states and 536 transitions. [2024-11-16 18:31:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 18:31:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2024-11-16 18:31:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:51,705 INFO L225 Difference]: With dead ends: 399 [2024-11-16 18:31:51,705 INFO L226 Difference]: Without dead ends: 265 [2024-11-16 18:31:51,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2024-11-16 18:31:51,707 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 416 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:51,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 960 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:31:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-16 18:31:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 214. [2024-11-16 18:31:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 states have internal predecessors, (249), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:31:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 285 transitions. [2024-11-16 18:31:51,724 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 285 transitions. Word has length 101 [2024-11-16 18:31:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:51,724 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 285 transitions. [2024-11-16 18:31:51,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:31:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 285 transitions. [2024-11-16 18:31:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:31:51,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:51,725 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:51,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 18:31:51,726 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:51,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2000083780, now seen corresponding path program 1 times [2024-11-16 18:31:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152808621] [2024-11-16 18:31:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:31:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:31:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:31:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:31:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:31:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:31:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:31:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:31:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:31:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:31:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:31:52,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152808621] [2024-11-16 18:31:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152808621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:31:52,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201922336] [2024-11-16 18:31:52,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:52,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:31:52,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:31:52,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:31:52,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 18:31:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:31:52,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 18:31:52,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:31:52,605 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-11-16 18:31:52,826 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-11-16 18:31:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 18:31:52,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:31:53,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-16 18:31:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:31:53,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201922336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:31:53,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 18:31:53,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2024-11-16 18:31:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250973050] [2024-11-16 18:31:53,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 18:31:53,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-16 18:31:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:31:53,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-16 18:31:53,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:31:53,184 INFO L87 Difference]: Start difference. First operand 214 states and 285 transitions. Second operand has 22 states, 19 states have (on average 7.105263157894737) internal successors, (135), 20 states have internal predecessors, (135), 8 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 8 states have call successors, (27) [2024-11-16 18:31:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:31:54,145 INFO L93 Difference]: Finished difference Result 407 states and 540 transitions. [2024-11-16 18:31:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-16 18:31:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.105263157894737) internal successors, (135), 20 states have internal predecessors, (135), 8 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 8 states have call successors, (27) Word has length 101 [2024-11-16 18:31:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:31:54,149 INFO L225 Difference]: With dead ends: 407 [2024-11-16 18:31:54,149 INFO L226 Difference]: Without dead ends: 269 [2024-11-16 18:31:54,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=1097, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 18:31:54,150 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1088 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:31:54,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1030 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:31:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-16 18:31:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 220. [2024-11-16 18:31:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 195 states have (on average 1.2717948717948717) internal successors, (248), 195 states have internal predecessors, (248), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:31:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 284 transitions. [2024-11-16 18:31:54,169 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 284 transitions. Word has length 101 [2024-11-16 18:31:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:31:54,170 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 284 transitions. [2024-11-16 18:31:54,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.105263157894737) internal successors, (135), 20 states have internal predecessors, (135), 8 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 8 states have call successors, (27) [2024-11-16 18:31:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 284 transitions. [2024-11-16 18:31:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 18:31:54,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:31:54,171 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:31:54,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 18:31:54,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:31:54,376 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:31:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:31:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash -751283903, now seen corresponding path program 1 times [2024-11-16 18:31:54,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:31:54,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133204906] [2024-11-16 18:31:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:31:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:31:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:31:54,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:31:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:31:54,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:31:54,596 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:31:54,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:31:54,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 18:31:54,601 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] [2024-11-16 18:31:54,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:31:54,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:31:54 BoogieIcfgContainer [2024-11-16 18:31:54,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:31:54,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:31:54,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:31:54,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:31:54,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:31:35" (3/4) ... [2024-11-16 18:31:54,761 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:31:54,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:31:54,762 INFO L158 Benchmark]: Toolchain (without parser) took 20593.13ms. Allocated memory was 159.4MB in the beginning and 541.1MB in the end (delta: 381.7MB). Free memory was 123.9MB in the beginning and 324.1MB in the end (delta: -200.1MB). Peak memory consumption was 181.0MB. Max. memory is 16.1GB. [2024-11-16 18:31:54,763 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:31:54,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.53ms. Allocated memory is still 159.4MB. Free memory was 123.9MB in the beginning and 108.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 18:31:54,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.08ms. Allocated memory is still 159.4MB. Free memory was 108.0MB in the beginning and 104.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:31:54,764 INFO L158 Benchmark]: Boogie Preprocessor took 86.53ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 100.3MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 18:31:54,764 INFO L158 Benchmark]: IcfgBuilder took 796.42ms. Allocated memory is still 159.4MB. Free memory was 100.3MB in the beginning and 90.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 18:31:54,764 INFO L158 Benchmark]: TraceAbstraction took 19311.91ms. Allocated memory was 159.4MB in the beginning and 541.1MB in the end (delta: 381.7MB). Free memory was 89.2MB in the beginning and 324.1MB in the end (delta: -234.9MB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. [2024-11-16 18:31:54,765 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 541.1MB. Free memory is still 324.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:31:54,766 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.53ms. Allocated memory is still 159.4MB. Free memory was 123.9MB in the beginning and 108.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.08ms. Allocated memory is still 159.4MB. Free memory was 108.0MB in the beginning and 104.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.53ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 100.3MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 796.42ms. Allocated memory is still 159.4MB. Free memory was 100.3MB in the beginning and 90.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19311.91ms. Allocated memory was 159.4MB in the beginning and 541.1MB in the end (delta: 381.7MB). Free memory was 89.2MB in the beginning and 324.1MB in the end (delta: -234.9MB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 541.1MB. Free memory is still 324.1MB. 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 97, overapproximation of bitwiseAnd at line 62, overapproximation of someBinaryArithmeticFLOAToperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L22] signed short int var_1_1 = -5; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned short int var_1_5 = 256; [L26] unsigned short int var_1_5 = 256; [L27] unsigned short int* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 44772; [L28] unsigned short int var_1_6 = 44772; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] float var_1_7 = 5.9; [L30] float var_1_7 = 5.9; [L31] float* var_1_7_Pointer = &(var_1_7); [L32] float var_1_8 = 7.6; [L32] float var_1_8 = 7.6; [L33] float* var_1_8_Pointer = &(var_1_8); [L34] float var_1_9 = 64.2; [L34] float var_1_9 = 64.2; [L35] float* var_1_9_Pointer = &(var_1_9); [L36] float var_1_10 = 128.75; [L36] float var_1_10 = 128.75; [L37] float* var_1_10_Pointer = &(var_1_10); [L38] unsigned long int var_1_11 = 8; [L38] unsigned long int var_1_11 = 8; [L39] unsigned long int* var_1_11_Pointer = &(var_1_11); [L40] unsigned long int var_1_12 = 3135928546; [L40] unsigned long int var_1_12 = 3135928546; [L41] unsigned long int* var_1_12_Pointer = &(var_1_12); [L42] signed short int last_1_var_1_1 = -5; [L43] unsigned long int last_1_var_1_11 = 8; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] EXPR \read(var_1_1) [L93] last_1_var_1_1 = var_1_1 [L94] EXPR \read(var_1_11) [L94] last_1_var_1_11 = var_1_11 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L76] var_1_4 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] var_1_6 = __VERIFIER_nondet_ushort() [L80] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_8 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_9 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_10 = __VERIFIER_nondet_float() [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_12 = __VERIFIER_nondet_ulong() [L89] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET updateVariables() [L106] CALL step() [L47] signed long int stepLocal_0 = last_1_var_1_1; [L48] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L48] COND TRUE (*(var_1_4_Pointer)) [L49] (*(var_1_5_Pointer)) = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR \read(*var_1_5_Pointer) [L55] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND TRUE (*(var_1_5_Pointer)) == (*(var_1_5_Pointer)) [L56] EXPR \read(*var_1_5_Pointer) [L56] (*(var_1_1_Pointer)) = ((*(var_1_5_Pointer)) + -16) [L62] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR (*(var_1_5_Pointer)) & last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND TRUE last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] (*(var_1_11_Pointer)) = ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))) [L71] EXPR \read(*var_1_1_Pointer) [L71] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] COND TRUE (*(var_1_1_Pointer)) < (*(var_1_5_Pointer)) [L72] EXPR \read(*var_1_8_Pointer) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR \read(*var_1_10_Pointer) [L72] (*(var_1_7_Pointer)) = (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) [L97] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 [L97] EXPR \read(*var_1_7_Pointer) [L97] EXPR \read(*var_1_8_Pointer) [L97] EXPR \read(*var_1_9_Pointer) [L97] EXPR \read(*var_1_10_Pointer) [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97-L98] return (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 20, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4825 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4816 mSDsluCounter, 15382 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11957 mSDsCounter, 470 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4891 IncrementalHoareTripleChecker+Invalid, 5361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 470 mSolverCounterUnsat, 3425 mSDtfsCounter, 4891 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 978 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=14, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1945 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 2163 NumberOfCodeBlocks, 2163 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2237 ConstructedInterpolants, 0 QuantifiedInterpolants, 8657 SizeOfPredicates, 21 NumberOfNonLiveVariables, 910 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 3162/3312 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-11-16 18:31:54,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.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 e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:31:57,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:31:57,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:31:57,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:31:57,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:31:57,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:31:57,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:31:57,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:31:57,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:31:57,210 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:31:57,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:31:57,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:31:57,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:31:57,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:31:57,212 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:31:57,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:31:57,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:31:57,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:31:57,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:31:57,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:31:57,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:31:57,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:31:57,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:31:57,218 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:31:57,218 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:31:57,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:31:57,218 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:31:57,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:31:57,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:31:57,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:31:57,219 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:31:57,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:31:57,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:31:57,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:31:57,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:31:57,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:31:57,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:31:57,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:31:57,221 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:31:57,224 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:31:57,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:31:57,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:31:57,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:31:57,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:31:57,225 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 -> e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf [2024-11-16 18:31:57,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:31:57,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:31:57,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:31:57,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:31:57,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:31:57,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-11-16 18:31:59,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:31:59,319 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:31:59,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-11-16 18:31:59,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe9ba1c31/f54c457cc86b4b1cb363e106c8b96eae/FLAG3ba532142 [2024-11-16 18:31:59,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe9ba1c31/f54c457cc86b4b1cb363e106c8b96eae [2024-11-16 18:31:59,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:31:59,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:31:59,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:31:59,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:31:59,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:31:59,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a39a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59, skipping insertion in model container [2024-11-16 18:31:59,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:31:59,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i[916,929] [2024-11-16 18:31:59,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:31:59,665 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:31:59,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i[916,929] [2024-11-16 18:31:59,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:31:59,743 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:31:59,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59 WrapperNode [2024-11-16 18:31:59,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:31:59,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:31:59,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:31:59,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:31:59,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,810 INFO L138 Inliner]: procedures = 36, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-11-16 18:31:59,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:31:59,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:31:59,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:31:59,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:31:59,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,883 INFO L175 MemorySlicer]: Split 96 memory accesses to 11 slices as follows [2, 8, 8, 17, 16, 3, 8, 10, 8, 8, 8]. 18 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1]. [2024-11-16 18:31:59,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:31:59,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:31:59,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:31:59,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:31:59,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (1/1) ... [2024-11-16 18:31:59,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:31:59,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:31:59,968 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-11-16 18:31:59,970 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-11-16 18:32:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:32:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:32:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:32:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 18:32:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-16 18:32:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:32:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-16 18:32:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-16 18:32:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-16 18:32:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-16 18:32:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-16 18:32:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-16 18:32:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:32:00,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:32:00,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:32:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-16 18:32:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:32:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-16 18:32:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-16 18:32:00,231 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:32:00,233 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:32:01,640 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite72#1;havoc property_#t~mem67#1;havoc property_#t~mem66#1;havoc property_#t~mem68#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem74#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem75#1;havoc property_#t~ite77#1;havoc property_#t~mem76#1;havoc property_#t~short81#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~ite105#1;havoc property_#t~mem100#1;havoc property_#t~mem91#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~ite99#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short106#1; [2024-11-16 18:32:01,688 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-16 18:32:01,689 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:32:01,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:32:01,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:32:01,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:32:01 BoogieIcfgContainer [2024-11-16 18:32:01,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:32:01,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:32:01,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:32:01,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:32:01,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:31:59" (1/3) ... [2024-11-16 18:32:01,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e05bf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:32:01, skipping insertion in model container [2024-11-16 18:32:01,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:31:59" (2/3) ... [2024-11-16 18:32:01,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e05bf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:32:01, skipping insertion in model container [2024-11-16 18:32:01,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:32:01" (3/3) ... [2024-11-16 18:32:01,711 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2024-11-16 18:32:01,724 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:32:01,724 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:32:01,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:32:01,798 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;@4a7b96b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:32:01,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:32:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 91 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:32:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 18:32:01,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:01,813 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:01,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:01,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1419755470, now seen corresponding path program 1 times [2024-11-16 18:32:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970892355] [2024-11-16 18:32:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:01,830 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-11-16 18:32:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:01,833 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-11-16 18:32:01,856 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-11-16 18:32:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:02,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:32:02,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-16 18:32:02,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:32:02,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970892355] [2024-11-16 18:32:02,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970892355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:32:02,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:32:02,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:32:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881454508] [2024-11-16 18:32:02,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:32:02,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:32:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:02,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:32:02,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:32:02,389 INFO L87 Difference]: Start difference. First operand has 102 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 91 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:02,412 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2024-11-16 18:32:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:32:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-16 18:32:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:02,420 INFO L225 Difference]: With dead ends: 193 [2024-11-16 18:32:02,420 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 18:32:02,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-11-16 18:32:02,426 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:02,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:32:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 18:32:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 18:32:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:32:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-11-16 18:32:02,459 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 91 [2024-11-16 18:32:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:02,460 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-11-16 18:32:02,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-11-16 18:32:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:32:02,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:02,463 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:02,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:32:02,664 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-11-16 18:32:02,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1654755582, now seen corresponding path program 1 times [2024-11-16 18:32:02,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675445673] [2024-11-16 18:32:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:02,666 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-11-16 18:32:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:02,669 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-11-16 18:32:02,670 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-11-16 18:32:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:03,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 18:32:03,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:03,911 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-11-16 18:32:03,994 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-11-16 18:32:03,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 46 [2024-11-16 18:32:04,123 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 76 treesize of output 60 [2024-11-16 18:32:04,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2024-11-16 18:32:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:32:04,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:32:04,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:04,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675445673] [2024-11-16 18:32:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675445673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:32:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:32:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:32:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535869380] [2024-11-16 18:32:04,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:32:04,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:32:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:04,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:32:04,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:32:04,176 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:05,361 INFO L93 Difference]: Finished difference Result 551 states and 774 transitions. [2024-11-16 18:32:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:32:05,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-16 18:32:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:05,369 INFO L225 Difference]: With dead ends: 551 [2024-11-16 18:32:05,369 INFO L226 Difference]: Without dead ends: 460 [2024-11-16 18:32:05,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:32:05,373 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 660 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:05,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1735 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:32:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-16 18:32:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 442. [2024-11-16 18:32:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 391 states have (on average 1.3759590792838874) internal successors, (538), 391 states have internal predecessors, (538), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:32:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 628 transitions. [2024-11-16 18:32:05,431 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 628 transitions. Word has length 94 [2024-11-16 18:32:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:05,431 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 628 transitions. [2024-11-16 18:32:05,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 628 transitions. [2024-11-16 18:32:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 18:32:05,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:05,434 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:05,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 18:32:05,634 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-11-16 18:32:05,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:05,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash -788759849, now seen corresponding path program 1 times [2024-11-16 18:32:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:05,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469940569] [2024-11-16 18:32:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:05,641 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-11-16 18:32:05,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:05,642 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-11-16 18:32:05,647 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-11-16 18:32:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:06,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:32:06,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:06,061 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-11-16 18:32:06,200 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 14 treesize of output 10 [2024-11-16 18:32:06,216 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-11-16 18:32:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:32:06,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:32:06,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:06,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469940569] [2024-11-16 18:32:06,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469940569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:32:06,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:32:06,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:32:06,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633476122] [2024-11-16 18:32:06,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:32:06,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:32:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:32:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:32:06,237 INFO L87 Difference]: Start difference. First operand 442 states and 628 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:06,577 INFO L93 Difference]: Finished difference Result 810 states and 1137 transitions. [2024-11-16 18:32:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:32:06,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-16 18:32:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:06,580 INFO L225 Difference]: With dead ends: 810 [2024-11-16 18:32:06,580 INFO L226 Difference]: Without dead ends: 371 [2024-11-16 18:32:06,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:32:06,583 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 414 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:06,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1106 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:32:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-16 18:32:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 269. [2024-11-16 18:32:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 238 states have (on average 1.365546218487395) internal successors, (325), 238 states have internal predecessors, (325), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:32:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2024-11-16 18:32:06,615 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 95 [2024-11-16 18:32:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:06,616 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2024-11-16 18:32:06,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2024-11-16 18:32:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 18:32:06,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:06,618 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:06,631 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-11-16 18:32:06,818 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-11-16 18:32:06,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:06,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 256755226, now seen corresponding path program 1 times [2024-11-16 18:32:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254015434] [2024-11-16 18:32:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:06,821 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-11-16 18:32:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:06,824 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-11-16 18:32:06,825 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-11-16 18:32:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:07,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 18:32:07,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:32:07,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:32:07,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:07,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254015434] [2024-11-16 18:32:07,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254015434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:32:07,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:32:07,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:32:07,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348428962] [2024-11-16 18:32:07,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:32:07,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:32:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:32:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:32:07,230 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:07,268 INFO L93 Difference]: Finished difference Result 549 states and 775 transitions. [2024-11-16 18:32:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:32:07,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-16 18:32:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:07,271 INFO L225 Difference]: With dead ends: 549 [2024-11-16 18:32:07,271 INFO L226 Difference]: Without dead ends: 283 [2024-11-16 18:32:07,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 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-11-16 18:32:07,273 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 20 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:07,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 252 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:32:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-16 18:32:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2024-11-16 18:32:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 177 states have (on average 1.3559322033898304) internal successors, (240), 177 states have internal predecessors, (240), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:32:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 276 transitions. [2024-11-16 18:32:07,285 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 276 transitions. Word has length 95 [2024-11-16 18:32:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:07,286 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 276 transitions. [2024-11-16 18:32:07,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 276 transitions. [2024-11-16 18:32:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 18:32:07,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:07,288 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:07,301 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-11-16 18:32:07,488 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-11-16 18:32:07,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1918635324, now seen corresponding path program 1 times [2024-11-16 18:32:07,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226790107] [2024-11-16 18:32:07,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:07,491 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-11-16 18:32:07,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:07,494 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-11-16 18:32:07,495 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-11-16 18:32:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:07,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 18:32:07,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:07,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-16 18:32:08,116 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-11-16 18:32:08,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-16 18:32:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:32:08,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:32:08,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226790107] [2024-11-16 18:32:08,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226790107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:32:08,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:32:08,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:32:08,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839946469] [2024-11-16 18:32:08,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:32:08,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:32:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:08,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:32:08,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:32:08,275 INFO L87 Difference]: Start difference. First operand 198 states and 276 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:08,706 INFO L93 Difference]: Finished difference Result 373 states and 512 transitions. [2024-11-16 18:32:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:32:08,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-16 18:32:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:08,711 INFO L225 Difference]: With dead ends: 373 [2024-11-16 18:32:08,713 INFO L226 Difference]: Without dead ends: 282 [2024-11-16 18:32:08,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:32:08,714 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 244 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:08,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1008 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:32:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-16 18:32:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 206. [2024-11-16 18:32:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 185 states have internal predecessors, (251), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:32:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2024-11-16 18:32:08,731 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 96 [2024-11-16 18:32:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:08,732 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2024-11-16 18:32:08,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2024-11-16 18:32:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 18:32:08,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:08,735 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:08,749 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-11-16 18:32:08,936 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-11-16 18:32:08,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:08,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1530407167, now seen corresponding path program 1 times [2024-11-16 18:32:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:08,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474318964] [2024-11-16 18:32:08,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:08,937 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-11-16 18:32:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:08,940 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-11-16 18:32:08,941 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-11-16 18:32:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:09,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:32:09,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:09,313 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-11-16 18:32:09,452 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 14 treesize of output 10 [2024-11-16 18:32:09,496 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-11-16 18:32:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:32:09,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:32:09,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474318964] [2024-11-16 18:32:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474318964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:32:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:32:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:32:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897657400] [2024-11-16 18:32:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:32:09,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:32:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:32:09,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:32:09,517 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:09,794 INFO L93 Difference]: Finished difference Result 420 states and 578 transitions. [2024-11-16 18:32:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:32:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-16 18:32:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:09,797 INFO L225 Difference]: With dead ends: 420 [2024-11-16 18:32:09,797 INFO L226 Difference]: Without dead ends: 321 [2024-11-16 18:32:09,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:32:09,798 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 335 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:09,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1031 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:32:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-16 18:32:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 202. [2024-11-16 18:32:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 181 states have (on average 1.3480662983425415) internal successors, (244), 181 states have internal predecessors, (244), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:32:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 280 transitions. [2024-11-16 18:32:09,809 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 280 transitions. Word has length 96 [2024-11-16 18:32:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 280 transitions. [2024-11-16 18:32:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 280 transitions. [2024-11-16 18:32:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 18:32:09,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:09,810 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:09,825 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-11-16 18:32:10,011 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-11-16 18:32:10,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:10,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash -334164804, now seen corresponding path program 1 times [2024-11-16 18:32:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:10,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007843056] [2024-11-16 18:32:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:10,013 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-11-16 18:32:10,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:10,014 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-11-16 18:32:10,015 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-11-16 18:32:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:10,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:32:10,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:10,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:32:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-16 18:32:10,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:32:11,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:32:11,190 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 23 treesize of output 26 [2024-11-16 18:32:11,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007843056] [2024-11-16 18:32:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007843056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:32:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [514531947] [2024-11-16 18:32:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:32:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:32:11,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:32:11,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-16 18:32:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:12,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:32:12,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:12,355 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-11-16 18:32:12,395 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 21 treesize of output 17 [2024-11-16 18:32:12,496 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 74 treesize of output 58 [2024-11-16 18:32:12,501 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 57 treesize of output 45 [2024-11-16 18:32:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:32:12,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:32:12,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [514531947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:32:12,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:32:12,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-16 18:32:12,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749028257] [2024-11-16 18:32:12,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:32:12,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:32:12,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:12,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:32:12,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:32:12,571 INFO L87 Difference]: Start difference. First operand 202 states and 280 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:13,461 INFO L93 Difference]: Finished difference Result 715 states and 992 transitions. [2024-11-16 18:32:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:32:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-16 18:32:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:13,464 INFO L225 Difference]: With dead ends: 715 [2024-11-16 18:32:13,464 INFO L226 Difference]: Without dead ends: 624 [2024-11-16 18:32:13,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-16 18:32:13,466 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 394 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:13,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1839 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:32:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-16 18:32:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 263. [2024-11-16 18:32:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 232 states have (on average 1.3448275862068966) internal successors, (312), 232 states have internal predecessors, (312), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:32:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 366 transitions. [2024-11-16 18:32:13,484 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 366 transitions. Word has length 97 [2024-11-16 18:32:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:13,485 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 366 transitions. [2024-11-16 18:32:13,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 366 transitions. [2024-11-16 18:32:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 18:32:13,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:13,486 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:13,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-16 18:32:13,696 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-11-16 18:32:13,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-16 18:32:13,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:13,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1883593149, now seen corresponding path program 1 times [2024-11-16 18:32:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:13,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512979572] [2024-11-16 18:32:13,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:13,889 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-11-16 18:32:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:13,890 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-11-16 18:32:13,893 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-11-16 18:32:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:14,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 18:32:14,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:14,234 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 21 treesize of output 17 [2024-11-16 18:32:14,282 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 66 treesize of output 54 [2024-11-16 18:32:14,288 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-11-16 18:32:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:32:14,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:32:14,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512979572] [2024-11-16 18:32:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512979572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:32:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:32:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:32:14,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229893606] [2024-11-16 18:32:14,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:32:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:32:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:14,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:32:14,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:32:14,308 INFO L87 Difference]: Start difference. First operand 263 states and 366 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:14,417 INFO L93 Difference]: Finished difference Result 444 states and 618 transitions. [2024-11-16 18:32:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:32:14,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-16 18:32:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:14,420 INFO L225 Difference]: With dead ends: 444 [2024-11-16 18:32:14,420 INFO L226 Difference]: Without dead ends: 353 [2024-11-16 18:32:14,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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-11-16 18:32:14,421 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 113 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:14,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 651 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:32:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-16 18:32:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 216. [2024-11-16 18:32:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 195 states have (on average 1.3487179487179488) internal successors, (263), 195 states have internal predecessors, (263), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:32:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 299 transitions. [2024-11-16 18:32:14,434 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 299 transitions. Word has length 97 [2024-11-16 18:32:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:14,434 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 299 transitions. [2024-11-16 18:32:14,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:32:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 299 transitions. [2024-11-16 18:32:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 18:32:14,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:14,436 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:14,450 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-11-16 18:32:14,636 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-11-16 18:32:14,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1827861754, now seen corresponding path program 1 times [2024-11-16 18:32:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700565457] [2024-11-16 18:32:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:14,637 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-11-16 18:32:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:14,639 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-11-16 18:32:14,640 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-11-16 18:32:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:41,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:32:41,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:41,950 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-11-16 18:32:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:32:41,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:32:42,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:32:42,496 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 39 treesize of output 38 [2024-11-16 18:32:42,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700565457] [2024-11-16 18:32:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700565457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:32:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [359121690] [2024-11-16 18:32:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:42,707 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:32:42,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:32:42,710 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:32:42,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-16 18:32:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:43,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 18:32:43,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:44,614 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-11-16 18:32:44,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-16 18:32:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:32:44,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:32:45,241 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 76 treesize of output 68 [2024-11-16 18:32:45,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [359121690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:32:45,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:32:45,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-16 18:32:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071578310] [2024-11-16 18:32:45,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:32:45,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 18:32:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:32:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 18:32:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-16 18:32:45,461 INFO L87 Difference]: Start difference. First operand 216 states and 299 transitions. Second operand has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 18:32:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:32:46,273 INFO L93 Difference]: Finished difference Result 612 states and 843 transitions. [2024-11-16 18:32:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 18:32:46,274 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2024-11-16 18:32:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:32:46,276 INFO L225 Difference]: With dead ends: 612 [2024-11-16 18:32:46,276 INFO L226 Difference]: Without dead ends: 399 [2024-11-16 18:32:46,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 18:32:46,278 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 426 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:32:46,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1127 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:32:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-16 18:32:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 290. [2024-11-16 18:32:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 258 states have (on average 1.3294573643410852) internal successors, (343), 258 states have internal predecessors, (343), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:32:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2024-11-16 18:32:46,296 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 98 [2024-11-16 18:32:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:32:46,297 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2024-11-16 18:32:46,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 18:32:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2024-11-16 18:32:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 18:32:46,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:32:46,298 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:32:46,330 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 (11)] Forceful destruction successful, exit code 0 [2024-11-16 18:32:46,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-16 18:32:46,699 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 18:32:46,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:32:46,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:32:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash -583097273, now seen corresponding path program 1 times [2024-11-16 18:32:46,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:32:46,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377792439] [2024-11-16 18:32:46,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:46,701 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-11-16 18:32:46,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:32:46,704 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-11-16 18:32:46,705 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-11-16 18:32:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:47,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:32:47,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:47,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:32:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-16 18:32:47,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:32:47,873 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-16 18:32:47,873 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 29 treesize of output 24 [2024-11-16 18:32:47,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:32:47,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377792439] [2024-11-16 18:32:47,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377792439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:32:47,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778843145] [2024-11-16 18:32:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:32:47,941 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:32:47,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:32:47,944 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:32:47,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-16 18:32:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:32:48,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 18:32:48,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:32:49,131 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