./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-33.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 24eb6d8aed88d8ad0c0a7297311d178ed920bbbfb0b7ffdf6d456efc32725bc4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:55:25,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:55:26,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:55:26,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:55:26,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:55:26,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:55:26,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:55:26,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:55:26,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:55:26,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:55:26,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:55:26,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:55:26,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:55:26,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:55:26,051 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:55:26,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:55:26,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:55:26,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:55:26,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:55:26,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:55:26,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:55:26,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:55:26,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:55:26,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:55:26,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:55:26,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:55:26,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:55:26,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:55:26,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:55:26,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:55:26,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:55:26,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:55:26,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:55:26,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:55:26,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:55:26,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:55:26,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:55:26,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:55:26,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:55:26,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:55:26,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:55:26,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:55:26,062 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 -> 24eb6d8aed88d8ad0c0a7297311d178ed920bbbfb0b7ffdf6d456efc32725bc4 [2024-11-19 00:55:26,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:55:26,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:55:26,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:55:26,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:55:26,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:55:26,331 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-33.i [2024-11-19 00:55:27,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:55:27,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:55:27,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-33.i [2024-11-19 00:55:27,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf77b60b/1559d7c6afd547138004778514d07ba2/FLAGf982dc61f [2024-11-19 00:55:28,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf77b60b/1559d7c6afd547138004778514d07ba2 [2024-11-19 00:55:28,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:55:28,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:55:28,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:55:28,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:55:28,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:55:28,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d493f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28, skipping insertion in model container [2024-11-19 00:55:28,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:55:28,388 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-33.i[916,929] [2024-11-19 00:55:28,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:55:28,472 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:55:28,482 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-33.i[916,929] [2024-11-19 00:55:28,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:55:28,582 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:55:28,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28 WrapperNode [2024-11-19 00:55:28,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:55:28,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:55:28,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:55:28,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:55:28,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,640 INFO L138 Inliner]: procedures = 29, calls = 147, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-11-19 00:55:28,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:55:28,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:55:28,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:55:28,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:55:28,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,684 INFO L175 MemorySlicer]: Split 115 memory accesses to 13 slices as follows [2, 5, 6, 23, 8, 3, 12, 14, 12, 12, 6, 3, 9]. 20 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1]. [2024-11-19 00:55:28,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:55:28,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:55:28,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:55:28,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:55:28,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (1/1) ... [2024-11-19 00:55:28,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:55:28,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:28,785 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-19 00:55:28,795 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-19 00:55:28,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:55:28,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:55:28,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:55:28,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:55:28,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:55:28,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:55:28,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:55:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:55:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 00:55:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 00:55:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 00:55:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-19 00:55:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-19 00:55:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-19 00:55:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:55:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:55:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:55:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:55:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:55:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:55:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:55:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 00:55:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 00:55:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 00:55:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 00:55:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 00:55:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 00:55:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:55:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:55:28,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:55:28,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:55:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:55:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:55:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:55:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 00:55:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 00:55:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 00:55:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-19 00:55:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-19 00:55:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-19 00:55:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:55:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:55:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:55:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:55:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:55:28,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:55:28,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:55:28,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:55:28,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:55:28,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 00:55:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 00:55:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 00:55:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-19 00:55:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-19 00:55:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-19 00:55:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:55:28,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:55:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:55:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:55:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:55:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:55:28,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:55:28,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:55:28,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:55:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 00:55:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 00:55:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 00:55:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 00:55:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 00:55:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 00:55:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:55:28,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:55:29,026 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:55:29,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:55:29,489 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-11-19 00:55:29,489 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:55:29,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:55:29,501 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:55:29,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:29 BoogieIcfgContainer [2024-11-19 00:55:29,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:55:29,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:55:29,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:55:29,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:55:29,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:55:28" (1/3) ... [2024-11-19 00:55:29,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e68e39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:55:29, skipping insertion in model container [2024-11-19 00:55:29,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:28" (2/3) ... [2024-11-19 00:55:29,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e68e39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:55:29, skipping insertion in model container [2024-11-19 00:55:29,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:29" (3/3) ... [2024-11-19 00:55:29,509 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-33.i [2024-11-19 00:55:29,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:55:29,523 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:55:29,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:55:29,577 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;@ddab33f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:55:29,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:55:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 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-19 00:55:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:55:29,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:29,592 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-19 00:55:29,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:29,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1099803334, now seen corresponding path program 1 times [2024-11-19 00:55:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656423850] [2024-11-19 00:55:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 00:55:29,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:29,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656423850] [2024-11-19 00:55:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656423850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:55:29,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751425391] [2024-11-19 00:55:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:29,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:55:29,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:29,840 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-19 00:55:29,842 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-19 00:55:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:30,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:55:30,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:30,141 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-19 00:55:30,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751425391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:30,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:55:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:55:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588615289] [2024-11-19 00:55:30,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:55:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:30,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:55:30,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:55:30,170 INFO L87 Difference]: Start difference. First operand has 107 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 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 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:55:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:30,190 INFO L93 Difference]: Finished difference Result 207 states and 319 transitions. [2024-11-19 00:55:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:55:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-19 00:55:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:30,198 INFO L225 Difference]: With dead ends: 207 [2024-11-19 00:55:30,198 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 00:55:30,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-19 00:55:30,203 INFO L432 NwaCegarLoop]: 151 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, 151 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-19 00:55:30,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:30,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 00:55:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-19 00:55:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 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-19 00:55:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-11-19 00:55:30,242 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 98 [2024-11-19 00:55:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:30,243 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-11-19 00:55:30,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:55:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-11-19 00:55:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:55:30,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:30,247 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-19 00:55:30,261 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-19 00:55:30,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:55:30,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:30,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash -990224056, now seen corresponding path program 1 times [2024-11-19 00:55:30,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:30,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547690714] [2024-11-19 00:55:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:30,676 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-19 00:55:30,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:30,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547690714] [2024-11-19 00:55:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547690714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:30,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:55:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748236865] [2024-11-19 00:55:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:30,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:30,682 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:55:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:30,723 INFO L93 Difference]: Finished difference Result 205 states and 302 transitions. [2024-11-19 00:55:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-19 00:55:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:30,725 INFO L225 Difference]: With dead ends: 205 [2024-11-19 00:55:30,726 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 00:55:30,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:30,728 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:30,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 00:55:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-19 00:55:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 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-19 00:55:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-11-19 00:55:30,737 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 98 [2024-11-19 00:55:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:30,738 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-11-19 00:55:30,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:55:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-11-19 00:55:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:55:30,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:30,741 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-19 00:55:30,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:55:30,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:30,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1038362054, now seen corresponding path program 1 times [2024-11-19 00:55:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046248932] [2024-11-19 00:55:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:30,904 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-19 00:55:30,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046248932] [2024-11-19 00:55:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046248932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:30,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:30,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:55:30,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972093911] [2024-11-19 00:55:30,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:30,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:30,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:30,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:30,907 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:30,947 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2024-11-19 00:55:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:30,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:30,949 INFO L225 Difference]: With dead ends: 210 [2024-11-19 00:55:30,949 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 00:55:30,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:30,952 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:30,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 00:55:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-19 00:55:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 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-19 00:55:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-11-19 00:55:30,967 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 98 [2024-11-19 00:55:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:30,968 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-11-19 00:55:30,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-11-19 00:55:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:55:30,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:30,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-19 00:55:30,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:55:30,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:30,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1481597880, now seen corresponding path program 1 times [2024-11-19 00:55:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24931366] [2024-11-19 00:55:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:31,117 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-19 00:55:31,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24931366] [2024-11-19 00:55:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24931366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:31,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:55:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142677792] [2024-11-19 00:55:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:31,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:31,123 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:31,146 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-11-19 00:55:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:31,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:31,149 INFO L225 Difference]: With dead ends: 214 [2024-11-19 00:55:31,149 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 00:55:31,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:31,150 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:31,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 00:55:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-19 00:55:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 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-19 00:55:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-19 00:55:31,163 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 98 [2024-11-19 00:55:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:31,167 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-19 00:55:31,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-19 00:55:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:55:31,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:31,168 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-19 00:55:31,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:55:31,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:31,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1479750838, now seen corresponding path program 1 times [2024-11-19 00:55:31,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:31,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965555070] [2024-11-19 00:55:31,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:31,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:31,718 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-19 00:55:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965555070] [2024-11-19 00:55:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965555070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:55:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915016229] [2024-11-19 00:55:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:31,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:55:31,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:31,723 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-19 00:55:31,726 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-19 00:55:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:31,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:55:31,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:31,990 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-19 00:55:32,011 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-19 00:55:32,289 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-19 00:55:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:55:32,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:55:32,474 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-19 00:55:32,547 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-19 00:55:32,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915016229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:55:32,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:55:32,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-19 00:55:32,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451472510] [2024-11-19 00:55:32,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:55:32,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 00:55:32,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:32,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 00:55:32,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:55:32,550 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 22 states, 19 states have (on average 6.0) internal successors, (114), 21 states have internal predecessors, (114), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-19 00:55:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:33,000 INFO L93 Difference]: Finished difference Result 330 states and 473 transitions. [2024-11-19 00:55:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:55:33,001 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.0) internal successors, (114), 21 states have internal predecessors, (114), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 98 [2024-11-19 00:55:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:33,003 INFO L225 Difference]: With dead ends: 330 [2024-11-19 00:55:33,003 INFO L226 Difference]: Without dead ends: 224 [2024-11-19 00:55:33,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=872, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 00:55:33,008 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 521 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:33,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1727 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:55:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-19 00:55:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 156. [2024-11-19 00:55:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.373134328358209) internal successors, (184), 134 states have internal predecessors, (184), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:55:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2024-11-19 00:55:33,028 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 98 [2024-11-19 00:55:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:33,028 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2024-11-19 00:55:33,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.0) internal successors, (114), 21 states have internal predecessors, (114), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-19 00:55:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2024-11-19 00:55:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:55:33,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:33,034 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-19 00:55:33,049 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-19 00:55:33,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:55:33,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:33,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash -93547444, now seen corresponding path program 1 times [2024-11-19 00:55:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:33,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020630674] [2024-11-19 00:55:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:34,323 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-19 00:55:34,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020630674] [2024-11-19 00:55:34,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020630674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:34,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:34,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:55:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782286217] [2024-11-19 00:55:34,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:34,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:55:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:55:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:55:34,328 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-19 00:55:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:34,634 INFO L93 Difference]: Finished difference Result 476 states and 685 transitions. [2024-11-19 00:55:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:55:34,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-19 00:55:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:34,636 INFO L225 Difference]: With dead ends: 476 [2024-11-19 00:55:34,637 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 00:55:34,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:55:34,639 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 250 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:34,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 993 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:55:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 00:55:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 279. [2024-11-19 00:55:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 247 states have (on average 1.408906882591093) internal successors, (348), 247 states have internal predecessors, (348), 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-19 00:55:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 402 transitions. [2024-11-19 00:55:34,665 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 402 transitions. Word has length 98 [2024-11-19 00:55:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:34,665 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 402 transitions. [2024-11-19 00:55:34,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-19 00:55:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 402 transitions. [2024-11-19 00:55:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:55:34,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:34,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] [2024-11-19 00:55:34,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:55:34,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:34,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:34,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1186316234, now seen corresponding path program 1 times [2024-11-19 00:55:34,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:34,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97714098] [2024-11-19 00:55:34,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:34,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:34,952 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-19 00:55:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:34,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97714098] [2024-11-19 00:55:34,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97714098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:34,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:34,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:55:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398987967] [2024-11-19 00:55:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:34,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:55:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:34,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:55:34,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:55:34,953 INFO L87 Difference]: Start difference. First operand 279 states and 402 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-19 00:55:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:35,108 INFO L93 Difference]: Finished difference Result 516 states and 749 transitions. [2024-11-19 00:55:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:55:35,109 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-19 00:55:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:35,110 INFO L225 Difference]: With dead ends: 516 [2024-11-19 00:55:35,110 INFO L226 Difference]: Without dead ends: 287 [2024-11-19 00:55:35,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:55:35,111 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 141 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:35,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 662 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-19 00:55:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2024-11-19 00:55:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 253 states have (on average 1.3992094861660078) internal successors, (354), 253 states have internal predecessors, (354), 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-19 00:55:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 408 transitions. [2024-11-19 00:55:35,133 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 408 transitions. Word has length 98 [2024-11-19 00:55:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:35,133 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 408 transitions. [2024-11-19 00:55:35,133 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-19 00:55:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 408 transitions. [2024-11-19 00:55:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:55:35,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:35,138 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-19 00:55:35,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:55:35,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:35,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1711890890, now seen corresponding path program 1 times [2024-11-19 00:55:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:35,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241862895] [2024-11-19 00:55:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:35,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:35,410 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-19 00:55:35,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:35,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241862895] [2024-11-19 00:55:35,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241862895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:35,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:35,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:55:35,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996039842] [2024-11-19 00:55:35,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:35,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:35,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:35,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:35,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:35,413 INFO L87 Difference]: Start difference. First operand 285 states and 408 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:35,524 INFO L93 Difference]: Finished difference Result 526 states and 758 transitions. [2024-11-19 00:55:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:35,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:35,526 INFO L225 Difference]: With dead ends: 526 [2024-11-19 00:55:35,526 INFO L226 Difference]: Without dead ends: 291 [2024-11-19 00:55:35,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:35,528 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 144 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:35,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 528 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-19 00:55:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2024-11-19 00:55:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 257 states have (on average 1.3929961089494163) internal successors, (358), 257 states have internal predecessors, (358), 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-19 00:55:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 412 transitions. [2024-11-19 00:55:35,545 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 412 transitions. Word has length 98 [2024-11-19 00:55:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:35,545 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 412 transitions. [2024-11-19 00:55:35,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (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-19 00:55:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 412 transitions. [2024-11-19 00:55:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:55:35,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:35,547 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-19 00:55:35,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:55:35,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash 981494475, now seen corresponding path program 1 times [2024-11-19 00:55:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:35,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797066466] [2024-11-19 00:55:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:35,625 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-19 00:55:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:35,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797066466] [2024-11-19 00:55:35,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797066466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:35,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:35,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:55:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882129879] [2024-11-19 00:55:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:35,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:35,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:35,628 INFO L87 Difference]: Start difference. First operand 289 states and 412 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-19 00:55:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:35,759 INFO L93 Difference]: Finished difference Result 722 states and 1034 transitions. [2024-11-19 00:55:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:35,760 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-19 00:55:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:35,763 INFO L225 Difference]: With dead ends: 722 [2024-11-19 00:55:35,763 INFO L226 Difference]: Without dead ends: 483 [2024-11-19 00:55:35,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:55:35,764 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 126 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:35,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 809 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-19 00:55:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 317. [2024-11-19 00:55:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 285 states have (on average 1.3964912280701753) internal successors, (398), 285 states have internal predecessors, (398), 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-19 00:55:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 452 transitions. [2024-11-19 00:55:35,792 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 452 transitions. Word has length 99 [2024-11-19 00:55:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:35,792 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 452 transitions. [2024-11-19 00:55:35,792 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-19 00:55:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 452 transitions. [2024-11-19 00:55:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:55:35,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:35,793 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-19 00:55:35,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:55:35,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:35,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2102007732, now seen corresponding path program 1 times [2024-11-19 00:55:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:35,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602106593] [2024-11-19 00:55:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:35,855 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-19 00:55:35,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:35,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602106593] [2024-11-19 00:55:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602106593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:35,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:35,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:55:35,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537886986] [2024-11-19 00:55:35,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:35,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:35,856 INFO L87 Difference]: Start difference. First operand 317 states and 452 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-19 00:55:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:35,948 INFO L93 Difference]: Finished difference Result 750 states and 1072 transitions. [2024-11-19 00:55:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:55:35,948 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-19 00:55:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:35,950 INFO L225 Difference]: With dead ends: 750 [2024-11-19 00:55:35,950 INFO L226 Difference]: Without dead ends: 483 [2024-11-19 00:55:35,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 00:55:35,951 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 142 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:35,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 676 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-19 00:55:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 317. [2024-11-19 00:55:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 285 states have (on average 1.3859649122807018) internal successors, (395), 285 states have internal predecessors, (395), 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-19 00:55:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 449 transitions. [2024-11-19 00:55:35,968 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 449 transitions. Word has length 99 [2024-11-19 00:55:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:35,968 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 449 transitions. [2024-11-19 00:55:35,968 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-19 00:55:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 449 transitions. [2024-11-19 00:55:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:55:35,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:35,969 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-19 00:55:35,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:55:35,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:35,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash 291706119, now seen corresponding path program 1 times [2024-11-19 00:55:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:35,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431591919] [2024-11-19 00:55:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:36,083 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-19 00:55:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431591919] [2024-11-19 00:55:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431591919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:55:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338651345] [2024-11-19 00:55:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:36,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:36,085 INFO L87 Difference]: Start difference. First operand 317 states and 449 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-19 00:55:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:36,133 INFO L93 Difference]: Finished difference Result 666 states and 949 transitions. [2024-11-19 00:55:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:36,134 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-19 00:55:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:36,137 INFO L225 Difference]: With dead ends: 666 [2024-11-19 00:55:36,137 INFO L226 Difference]: Without dead ends: 399 [2024-11-19 00:55:36,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:55:36,138 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 75 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:36,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 569 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-19 00:55:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 365. [2024-11-19 00:55:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 333 states have (on average 1.3933933933933933) internal successors, (464), 333 states have internal predecessors, (464), 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-19 00:55:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 518 transitions. [2024-11-19 00:55:36,156 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 518 transitions. Word has length 100 [2024-11-19 00:55:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:36,157 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 518 transitions. [2024-11-19 00:55:36,157 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-19 00:55:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 518 transitions. [2024-11-19 00:55:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:55:36,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:36,158 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-19 00:55:36,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:55:36,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:36,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash -719411131, now seen corresponding path program 1 times [2024-11-19 00:55:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:36,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511880293] [2024-11-19 00:55:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:36,295 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-19 00:55:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511880293] [2024-11-19 00:55:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511880293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:55:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643478193] [2024-11-19 00:55:36,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:55:36,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:36,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:55:36,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:55:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:36,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:55:36,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:36,502 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-19 00:55:36,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643478193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:36,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:55:36,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:55:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349814267] [2024-11-19 00:55:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:36,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:36,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:36,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:55:36,504 INFO L87 Difference]: Start difference. First operand 365 states and 518 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-19 00:55:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:36,531 INFO L93 Difference]: Finished difference Result 685 states and 977 transitions. [2024-11-19 00:55:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:36,531 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-19 00:55:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:36,533 INFO L225 Difference]: With dead ends: 685 [2024-11-19 00:55:36,533 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 00:55:36,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:55:36,533 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:36,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 00:55:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-19 00:55:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 338 states have (on average 1.3875739644970415) internal successors, (469), 338 states have internal predecessors, (469), 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-19 00:55:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2024-11-19 00:55:36,545 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 523 transitions. Word has length 100 [2024-11-19 00:55:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:36,545 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 523 transitions. [2024-11-19 00:55:36,546 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-19 00:55:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 523 transitions. [2024-11-19 00:55:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:55:36,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:36,546 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-19 00:55:36,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:55:36,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:55:36,747 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:36,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1285245815, now seen corresponding path program 1 times [2024-11-19 00:55:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716402009] [2024-11-19 00:55:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:37,029 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-19 00:55:37,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:37,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716402009] [2024-11-19 00:55:37,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716402009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:37,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:37,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 00:55:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917837401] [2024-11-19 00:55:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:37,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:55:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:55:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:55:37,033 INFO L87 Difference]: Start difference. First operand 370 states and 523 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-19 00:55:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:37,832 INFO L93 Difference]: Finished difference Result 1157 states and 1643 transitions. [2024-11-19 00:55:37,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:55:37,833 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-19 00:55:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:37,836 INFO L225 Difference]: With dead ends: 1157 [2024-11-19 00:55:37,836 INFO L226 Difference]: Without dead ends: 837 [2024-11-19 00:55:37,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:55:37,838 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 378 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:37,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 2777 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:55:37,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-19 00:55:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 415. [2024-11-19 00:55:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 383 states have (on average 1.412532637075718) internal successors, (541), 383 states have internal predecessors, (541), 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-19 00:55:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 595 transitions. [2024-11-19 00:55:37,865 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 595 transitions. Word has length 100 [2024-11-19 00:55:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:37,865 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 595 transitions. [2024-11-19 00:55:37,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-19 00:55:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 595 transitions. [2024-11-19 00:55:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:55:37,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:37,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, 1] [2024-11-19 00:55:37,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:55:37,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:37,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1863871309, now seen corresponding path program 1 times [2024-11-19 00:55:37,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:37,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871389655] [2024-11-19 00:55:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:37,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:38,145 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-19 00:55:38,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:38,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871389655] [2024-11-19 00:55:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871389655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:38,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:38,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 00:55:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870794038] [2024-11-19 00:55:38,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:38,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:55:38,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:38,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:55:38,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:55:38,147 INFO L87 Difference]: Start difference. First operand 415 states and 595 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-19 00:55:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:38,753 INFO L93 Difference]: Finished difference Result 1231 states and 1768 transitions. [2024-11-19 00:55:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:55:38,753 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-19 00:55:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:38,756 INFO L225 Difference]: With dead ends: 1231 [2024-11-19 00:55:38,756 INFO L226 Difference]: Without dead ends: 866 [2024-11-19 00:55:38,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:55:38,758 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 470 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:38,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1906 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:55:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-19 00:55:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 463. [2024-11-19 00:55:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 431 states have (on average 1.4222737819025522) internal successors, (613), 431 states have internal predecessors, (613), 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-19 00:55:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 667 transitions. [2024-11-19 00:55:38,779 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 667 transitions. Word has length 100 [2024-11-19 00:55:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:38,780 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 667 transitions. [2024-11-19 00:55:38,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-19 00:55:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 667 transitions. [2024-11-19 00:55:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:55:38,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:38,782 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-19 00:55:38,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:55:38,782 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:38,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1151232309, now seen corresponding path program 1 times [2024-11-19 00:55:38,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:38,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51585020] [2024-11-19 00:55:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:38,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:38,919 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-19 00:55:38,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51585020] [2024-11-19 00:55:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51585020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:38,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:38,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:55:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939147713] [2024-11-19 00:55:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:38,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:38,921 INFO L87 Difference]: Start difference. First operand 463 states and 667 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-19 00:55:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:38,981 INFO L93 Difference]: Finished difference Result 1132 states and 1631 transitions. [2024-11-19 00:55:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:38,981 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-19 00:55:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:38,984 INFO L225 Difference]: With dead ends: 1132 [2024-11-19 00:55:38,984 INFO L226 Difference]: Without dead ends: 719 [2024-11-19 00:55:38,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 00:55:38,986 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 139 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:38,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 997 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-19 00:55:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 501. [2024-11-19 00:55:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 469 states have (on average 1.4264392324093818) internal successors, (669), 469 states have internal predecessors, (669), 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-19 00:55:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 723 transitions. [2024-11-19 00:55:39,011 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 723 transitions. Word has length 100 [2024-11-19 00:55:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:39,011 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 723 transitions. [2024-11-19 00:55:39,012 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-19 00:55:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 723 transitions. [2024-11-19 00:55:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 00:55:39,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:39,013 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-19 00:55:39,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:55:39,013 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:39,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash -54842628, now seen corresponding path program 1 times [2024-11-19 00:55:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538145787] [2024-11-19 00:55:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:39,327 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-19 00:55:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538145787] [2024-11-19 00:55:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538145787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:39,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:55:39,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031988732] [2024-11-19 00:55:39,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:55:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:55:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:55:39,329 INFO L87 Difference]: Start difference. First operand 501 states and 723 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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-19 00:55:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:39,945 INFO L93 Difference]: Finished difference Result 1611 states and 2322 transitions. [2024-11-19 00:55:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:55:39,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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-19 00:55:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:39,949 INFO L225 Difference]: With dead ends: 1611 [2024-11-19 00:55:39,949 INFO L226 Difference]: Without dead ends: 1160 [2024-11-19 00:55:39,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:55:39,954 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 425 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:39,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1710 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:55:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-19 00:55:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 579. [2024-11-19 00:55:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 547 states have (on average 1.453382084095064) internal successors, (795), 547 states have internal predecessors, (795), 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-19 00:55:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 849 transitions. [2024-11-19 00:55:39,980 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 849 transitions. Word has length 101 [2024-11-19 00:55:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:39,981 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 849 transitions. [2024-11-19 00:55:39,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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-19 00:55:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 849 transitions. [2024-11-19 00:55:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 00:55:39,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:39,982 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-19 00:55:39,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:55:39,982 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1475254916, now seen corresponding path program 1 times [2024-11-19 00:55:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213950986] [2024-11-19 00:55:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:40,237 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-19 00:55:40,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:40,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213950986] [2024-11-19 00:55:40,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213950986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:40,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:40,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:55:40,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305049127] [2024-11-19 00:55:40,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:40,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:55:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:40,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:55:40,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:55:40,239 INFO L87 Difference]: Start difference. First operand 579 states and 849 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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-19 00:55:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:40,766 INFO L93 Difference]: Finished difference Result 1568 states and 2276 transitions. [2024-11-19 00:55:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:55:40,767 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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-19 00:55:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:40,770 INFO L225 Difference]: With dead ends: 1568 [2024-11-19 00:55:40,770 INFO L226 Difference]: Without dead ends: 1033 [2024-11-19 00:55:40,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:55:40,771 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 346 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:40,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 2293 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:55:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-11-19 00:55:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 603. [2024-11-19 00:55:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 571 states have (on average 1.4553415061295971) internal successors, (831), 571 states have internal predecessors, (831), 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-19 00:55:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 885 transitions. [2024-11-19 00:55:40,795 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 885 transitions. Word has length 101 [2024-11-19 00:55:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:40,795 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 885 transitions. [2024-11-19 00:55:40,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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-19 00:55:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 885 transitions. [2024-11-19 00:55:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:55:40,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:40,796 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] [2024-11-19 00:55:40,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:55:40,796 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:40,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:40,797 INFO L85 PathProgramCache]: Analyzing trace with hash 418921356, now seen corresponding path program 1 times [2024-11-19 00:55:40,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:40,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730720948] [2024-11-19 00:55:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:40,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:41,148 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-19 00:55:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:41,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730720948] [2024-11-19 00:55:41,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730720948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:41,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:41,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 00:55:41,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205920692] [2024-11-19 00:55:41,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:41,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:55:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:55:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:55:41,151 INFO L87 Difference]: Start difference. First operand 603 states and 885 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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-19 00:55:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:41,801 INFO L93 Difference]: Finished difference Result 2021 states and 2936 transitions. [2024-11-19 00:55:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:55:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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 102 [2024-11-19 00:55:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:41,812 INFO L225 Difference]: With dead ends: 2021 [2024-11-19 00:55:41,812 INFO L226 Difference]: Without dead ends: 1462 [2024-11-19 00:55:41,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:55:41,814 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 426 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:41,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2823 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:55:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-11-19 00:55:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 692. [2024-11-19 00:55:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 660 states have (on average 1.4621212121212122) internal successors, (965), 660 states have internal predecessors, (965), 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-19 00:55:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1019 transitions. [2024-11-19 00:55:41,871 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1019 transitions. Word has length 102 [2024-11-19 00:55:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:41,872 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1019 transitions. [2024-11-19 00:55:41,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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-19 00:55:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1019 transitions. [2024-11-19 00:55:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:55:41,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:41,873 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] [2024-11-19 00:55:41,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:55:41,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:41,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash 67003244, now seen corresponding path program 1 times [2024-11-19 00:55:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:41,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251225942] [2024-11-19 00:55:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:41,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:42,035 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-19 00:55:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251225942] [2024-11-19 00:55:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251225942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:42,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:42,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:55:42,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477027327] [2024-11-19 00:55:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:42,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:55:42,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:42,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:55:42,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:55:42,038 INFO L87 Difference]: Start difference. First operand 692 states and 1019 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-19 00:55:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:42,279 INFO L93 Difference]: Finished difference Result 1650 states and 2431 transitions. [2024-11-19 00:55:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:55:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 102 [2024-11-19 00:55:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:42,282 INFO L225 Difference]: With dead ends: 1650 [2024-11-19 00:55:42,282 INFO L226 Difference]: Without dead ends: 1008 [2024-11-19 00:55:42,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:55:42,284 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 132 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:42,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1723 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:55:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-11-19 00:55:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 716. [2024-11-19 00:55:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 684 states have (on average 1.4678362573099415) internal successors, (1004), 684 states have internal predecessors, (1004), 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-19 00:55:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1058 transitions. [2024-11-19 00:55:42,310 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1058 transitions. Word has length 102 [2024-11-19 00:55:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:42,311 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1058 transitions. [2024-11-19 00:55:42,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-19 00:55:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1058 transitions. [2024-11-19 00:55:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:55:42,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:42,312 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] [2024-11-19 00:55:42,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:55:42,312 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash -922981936, now seen corresponding path program 1 times [2024-11-19 00:55:42,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:42,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393659911] [2024-11-19 00:55:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:42,579 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-19 00:55:42,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:42,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393659911] [2024-11-19 00:55:42,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393659911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:42,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:42,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:55:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17939532] [2024-11-19 00:55:42,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:42,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:55:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:42,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:55:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:55:42,581 INFO L87 Difference]: Start difference. First operand 716 states and 1058 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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-19 00:55:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:42,917 INFO L93 Difference]: Finished difference Result 1514 states and 2229 transitions. [2024-11-19 00:55:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:55:42,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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 102 [2024-11-19 00:55:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:42,920 INFO L225 Difference]: With dead ends: 1514 [2024-11-19 00:55:42,920 INFO L226 Difference]: Without dead ends: 848 [2024-11-19 00:55:42,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:55:42,922 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 523 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:42,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 893 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:55:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-19 00:55:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 660. [2024-11-19 00:55:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 628 states have (on average 1.4378980891719746) internal successors, (903), 628 states have internal predecessors, (903), 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-19 00:55:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 957 transitions. [2024-11-19 00:55:42,944 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 957 transitions. Word has length 102 [2024-11-19 00:55:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:42,944 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 957 transitions. [2024-11-19 00:55:42,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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-19 00:55:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 957 transitions. [2024-11-19 00:55:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:55:42,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:42,945 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] [2024-11-19 00:55:42,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 00:55:42,946 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:42,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1274900048, now seen corresponding path program 1 times [2024-11-19 00:55:42,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079211064] [2024-11-19 00:55:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:42,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:43,075 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-19 00:55:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079211064] [2024-11-19 00:55:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079211064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:43,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:55:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4085414] [2024-11-19 00:55:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:43,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:55:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:43,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:55:43,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:55:43,077 INFO L87 Difference]: Start difference. First operand 660 states and 957 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-19 00:55:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:43,389 INFO L93 Difference]: Finished difference Result 1500 states and 2167 transitions. [2024-11-19 00:55:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:55:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 102 [2024-11-19 00:55:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:43,396 INFO L225 Difference]: With dead ends: 1500 [2024-11-19 00:55:43,396 INFO L226 Difference]: Without dead ends: 884 [2024-11-19 00:55:43,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:55:43,398 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 133 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:43,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1336 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:55:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-11-19 00:55:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 672. [2024-11-19 00:55:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 640 states have (on average 1.434375) internal successors, (918), 640 states have internal predecessors, (918), 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-19 00:55:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 972 transitions. [2024-11-19 00:55:43,426 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 972 transitions. Word has length 102 [2024-11-19 00:55:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:43,427 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 972 transitions. [2024-11-19 00:55:43,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-19 00:55:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 972 transitions. [2024-11-19 00:55:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:55:43,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:43,428 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-19 00:55:43,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:55:43,428 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1720377663, now seen corresponding path program 1 times [2024-11-19 00:55:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665168111] [2024-11-19 00:55:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:43,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:43,716 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-19 00:55:43,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665168111] [2024-11-19 00:55:43,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665168111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:43,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:43,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:55:43,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502096470] [2024-11-19 00:55:43,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:43,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:55:43,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:43,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:55:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:55:43,724 INFO L87 Difference]: Start difference. First operand 672 states and 972 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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-19 00:55:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:44,298 INFO L93 Difference]: Finished difference Result 1853 states and 2663 transitions. [2024-11-19 00:55:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:55:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 103 [2024-11-19 00:55:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:44,303 INFO L225 Difference]: With dead ends: 1853 [2024-11-19 00:55:44,304 INFO L226 Difference]: Without dead ends: 1231 [2024-11-19 00:55:44,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:55:44,306 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 419 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:44,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1709 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:55:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-19 00:55:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 671. [2024-11-19 00:55:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 639 states have (on average 1.4366197183098592) internal successors, (918), 639 states have internal predecessors, (918), 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-19 00:55:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 972 transitions. [2024-11-19 00:55:44,350 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 972 transitions. Word has length 103 [2024-11-19 00:55:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:44,350 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 972 transitions. [2024-11-19 00:55:44,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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-19 00:55:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 972 transitions. [2024-11-19 00:55:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:55:44,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:44,352 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-19 00:55:44,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:55:44,352 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:44,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1482714049, now seen corresponding path program 1 times [2024-11-19 00:55:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:44,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881960136] [2024-11-19 00:55:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:44,804 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-19 00:55:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:44,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881960136] [2024-11-19 00:55:44,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881960136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:44,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:44,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:55:44,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206111341] [2024-11-19 00:55:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:44,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:55:44,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:55:44,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:55:44,807 INFO L87 Difference]: Start difference. First operand 671 states and 972 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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-19 00:55:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:45,374 INFO L93 Difference]: Finished difference Result 1693 states and 2429 transitions. [2024-11-19 00:55:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:55:45,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 103 [2024-11-19 00:55:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:45,378 INFO L225 Difference]: With dead ends: 1693 [2024-11-19 00:55:45,378 INFO L226 Difference]: Without dead ends: 1042 [2024-11-19 00:55:45,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:55:45,379 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 338 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:45,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 2203 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:55:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-19 00:55:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 677. [2024-11-19 00:55:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 645 states have (on average 1.4372093023255814) internal successors, (927), 645 states have internal predecessors, (927), 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-19 00:55:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 981 transitions. [2024-11-19 00:55:45,400 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 981 transitions. Word has length 103 [2024-11-19 00:55:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:45,401 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 981 transitions. [2024-11-19 00:55:45,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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-19 00:55:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 981 transitions. [2024-11-19 00:55:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:55:45,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:45,402 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-19 00:55:45,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 00:55:45,402 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:45,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 104136137, now seen corresponding path program 1 times [2024-11-19 00:55:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275583221] [2024-11-19 00:55:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:45,619 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-19 00:55:45,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275583221] [2024-11-19 00:55:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275583221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:45,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:45,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:55:45,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692958272] [2024-11-19 00:55:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:45,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:55:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:55:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:55:45,622 INFO L87 Difference]: Start difference. First operand 677 states and 981 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-19 00:55:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:45,925 INFO L93 Difference]: Finished difference Result 1608 states and 2334 transitions. [2024-11-19 00:55:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:55:45,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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 103 [2024-11-19 00:55:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:45,928 INFO L225 Difference]: With dead ends: 1608 [2024-11-19 00:55:45,928 INFO L226 Difference]: Without dead ends: 981 [2024-11-19 00:55:45,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:55:45,929 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 131 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:45,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1760 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:55:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-19 00:55:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 665. [2024-11-19 00:55:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 633 states have (on average 1.4312796208530805) internal successors, (906), 633 states have internal predecessors, (906), 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-19 00:55:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 960 transitions. [2024-11-19 00:55:45,950 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 960 transitions. Word has length 103 [2024-11-19 00:55:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:45,951 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 960 transitions. [2024-11-19 00:55:45,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-19 00:55:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 960 transitions. [2024-11-19 00:55:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:55:45,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:45,952 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-19 00:55:45,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 00:55:45,952 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:45,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1170823199, now seen corresponding path program 1 times [2024-11-19 00:55:45,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:45,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025811307] [2024-11-19 00:55:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:46,150 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-19 00:55:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:46,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025811307] [2024-11-19 00:55:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025811307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:46,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:46,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:55:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045368455] [2024-11-19 00:55:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:46,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:55:46,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:55:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:55:46,153 INFO L87 Difference]: Start difference. First operand 665 states and 960 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-19 00:55:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:46,598 INFO L93 Difference]: Finished difference Result 1466 states and 2111 transitions. [2024-11-19 00:55:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:55:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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 103 [2024-11-19 00:55:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:46,601 INFO L225 Difference]: With dead ends: 1466 [2024-11-19 00:55:46,601 INFO L226 Difference]: Without dead ends: 851 [2024-11-19 00:55:46,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:55:46,602 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 516 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:46,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1318 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:55:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-19 00:55:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 648. [2024-11-19 00:55:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 616 states have (on average 1.426948051948052) internal successors, (879), 616 states have internal predecessors, (879), 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-19 00:55:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 933 transitions. [2024-11-19 00:55:46,636 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 933 transitions. Word has length 103 [2024-11-19 00:55:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:46,636 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 933 transitions. [2024-11-19 00:55:46,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-19 00:55:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 933 transitions. [2024-11-19 00:55:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:55:46,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:46,637 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-19 00:55:46,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 00:55:46,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:46,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:46,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2075774890, now seen corresponding path program 1 times [2024-11-19 00:55:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:46,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635178084] [2024-11-19 00:55:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:46,777 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-19 00:55:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:46,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635178084] [2024-11-19 00:55:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635178084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:46,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:55:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205707062] [2024-11-19 00:55:46,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:46,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:55:46,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:46,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:55:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:55:46,779 INFO L87 Difference]: Start difference. First operand 648 states and 933 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-19 00:55:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:47,056 INFO L93 Difference]: Finished difference Result 1839 states and 2629 transitions. [2024-11-19 00:55:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:55:47,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 103 [2024-11-19 00:55:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:47,059 INFO L225 Difference]: With dead ends: 1839 [2024-11-19 00:55:47,059 INFO L226 Difference]: Without dead ends: 1241 [2024-11-19 00:55:47,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:55:47,061 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 345 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:47,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1429 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:55:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-19 00:55:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 684. [2024-11-19 00:55:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 652 states have (on average 1.3941717791411044) internal successors, (909), 652 states have internal predecessors, (909), 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-19 00:55:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 963 transitions. [2024-11-19 00:55:47,084 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 963 transitions. Word has length 103 [2024-11-19 00:55:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:47,084 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 963 transitions. [2024-11-19 00:55:47,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-19 00:55:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 963 transitions. [2024-11-19 00:55:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:55:47,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:47,085 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, 1] [2024-11-19 00:55:47,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 00:55:47,085 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:47,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash -339049141, now seen corresponding path program 1 times [2024-11-19 00:55:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:47,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623417827] [2024-11-19 00:55:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:47,172 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-19 00:55:47,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:47,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623417827] [2024-11-19 00:55:47,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623417827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:55:47,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873123958] [2024-11-19 00:55:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:47,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:55:47,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:47,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:55:47,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:55:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:47,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:55:47,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:47,394 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-19 00:55:47,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873123958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:47,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:55:47,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:55:47,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64019218] [2024-11-19 00:55:47,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:47,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:55:47,399 INFO L87 Difference]: Start difference. First operand 684 states and 963 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-19 00:55:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:47,434 INFO L93 Difference]: Finished difference Result 1324 states and 1868 transitions. [2024-11-19 00:55:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 104 [2024-11-19 00:55:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:47,436 INFO L225 Difference]: With dead ends: 1324 [2024-11-19 00:55:47,436 INFO L226 Difference]: Without dead ends: 690 [2024-11-19 00:55:47,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:55:47,437 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:47,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-19 00:55:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-11-19 00:55:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 658 states have (on average 1.3905775075987843) internal successors, (915), 658 states have internal predecessors, (915), 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-19 00:55:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 969 transitions. [2024-11-19 00:55:47,472 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 969 transitions. Word has length 104 [2024-11-19 00:55:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 969 transitions. [2024-11-19 00:55:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-19 00:55:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 969 transitions. [2024-11-19 00:55:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:55:47,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:47,474 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, 1] [2024-11-19 00:55:47,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:55:47,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 00:55:47,678 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:47,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1444823633, now seen corresponding path program 1 times [2024-11-19 00:55:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937994392] [2024-11-19 00:55:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:48,056 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-19 00:55:48,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937994392] [2024-11-19 00:55:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937994392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:48,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:48,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:55:48,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215229973] [2024-11-19 00:55:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:48,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:55:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:55:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:55:48,058 INFO L87 Difference]: Start difference. First operand 690 states and 969 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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-19 00:55:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:48,364 INFO L93 Difference]: Finished difference Result 1356 states and 1909 transitions. [2024-11-19 00:55:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:55:48,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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 104 [2024-11-19 00:55:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:48,366 INFO L225 Difference]: With dead ends: 1356 [2024-11-19 00:55:48,366 INFO L226 Difference]: Without dead ends: 686 [2024-11-19 00:55:48,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:55:48,367 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 141 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:48,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1133 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:55:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-19 00:55:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 506. [2024-11-19 00:55:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 474 states have (on average 1.358649789029536) internal successors, (644), 474 states have internal predecessors, (644), 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-19 00:55:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 698 transitions. [2024-11-19 00:55:48,387 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 698 transitions. Word has length 104 [2024-11-19 00:55:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:48,387 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 698 transitions. [2024-11-19 00:55:48,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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-19 00:55:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 698 transitions. [2024-11-19 00:55:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:55:48,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:48,388 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, 1] [2024-11-19 00:55:48,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 00:55:48,388 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:48,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2079753075, now seen corresponding path program 1 times [2024-11-19 00:55:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:48,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067110203] [2024-11-19 00:55:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:48,636 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-19 00:55:48,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067110203] [2024-11-19 00:55:48,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067110203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:48,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:48,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:55:48,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190548329] [2024-11-19 00:55:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:48,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:55:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:48,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:55:48,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:55:48,638 INFO L87 Difference]: Start difference. First operand 506 states and 698 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-19 00:55:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:48,818 INFO L93 Difference]: Finished difference Result 902 states and 1254 transitions. [2024-11-19 00:55:48,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:55:48,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 104 [2024-11-19 00:55:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:48,820 INFO L225 Difference]: With dead ends: 902 [2024-11-19 00:55:48,820 INFO L226 Difference]: Without dead ends: 446 [2024-11-19 00:55:48,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:55:48,821 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 147 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:48,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 606 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-19 00:55:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 431. [2024-11-19 00:55:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 399 states have (on average 1.3659147869674186) internal successors, (545), 399 states have internal predecessors, (545), 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-19 00:55:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 599 transitions. [2024-11-19 00:55:48,845 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 599 transitions. Word has length 104 [2024-11-19 00:55:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:48,845 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 599 transitions. [2024-11-19 00:55:48,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-19 00:55:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 599 transitions. [2024-11-19 00:55:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:55:48,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:48,846 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, 1] [2024-11-19 00:55:48,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 00:55:48,846 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:48,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash -850857107, now seen corresponding path program 1 times [2024-11-19 00:55:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:48,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97762629] [2024-11-19 00:55:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:49,040 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-19 00:55:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97762629] [2024-11-19 00:55:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97762629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:55:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252121489] [2024-11-19 00:55:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:49,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:55:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:49,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:55:49,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:55:49,042 INFO L87 Difference]: Start difference. First operand 431 states and 599 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-19 00:55:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:49,217 INFO L93 Difference]: Finished difference Result 773 states and 1081 transitions. [2024-11-19 00:55:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:55:49,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 104 [2024-11-19 00:55:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:49,218 INFO L225 Difference]: With dead ends: 773 [2024-11-19 00:55:49,218 INFO L226 Difference]: Without dead ends: 392 [2024-11-19 00:55:49,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:55:49,219 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 142 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:49,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 780 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-19 00:55:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 377. [2024-11-19 00:55:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 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-19 00:55:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 525 transitions. [2024-11-19 00:55:49,239 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 525 transitions. Word has length 104 [2024-11-19 00:55:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:49,239 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 525 transitions. [2024-11-19 00:55:49,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-19 00:55:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 525 transitions. [2024-11-19 00:55:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 00:55:49,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:49,240 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, 1, 1, 1] [2024-11-19 00:55:49,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 00:55:49,240 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:49,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1900761118, now seen corresponding path program 1 times [2024-11-19 00:55:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:49,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976490698] [2024-11-19 00:55:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:50,023 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-19 00:55:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976490698] [2024-11-19 00:55:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976490698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:55:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516795003] [2024-11-19 00:55:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:50,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:55:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:55:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:55:50,027 INFO L87 Difference]: Start difference. First operand 377 states and 525 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-19 00:55:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:50,194 INFO L93 Difference]: Finished difference Result 385 states and 532 transitions. [2024-11-19 00:55:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:55:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 106 [2024-11-19 00:55:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:50,196 INFO L225 Difference]: With dead ends: 385 [2024-11-19 00:55:50,196 INFO L226 Difference]: Without dead ends: 383 [2024-11-19 00:55:50,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:55:50,198 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 141 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:50,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1113 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-19 00:55:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2024-11-19 00:55:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 348 states have (on average 1.3620689655172413) internal successors, (474), 348 states have internal predecessors, (474), 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-19 00:55:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 528 transitions. [2024-11-19 00:55:50,217 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 528 transitions. Word has length 106 [2024-11-19 00:55:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 528 transitions. [2024-11-19 00:55:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-19 00:55:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 528 transitions. [2024-11-19 00:55:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 00:55:50,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:50,218 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, 1, 1, 1] [2024-11-19 00:55:50,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 00:55:50,218 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:50,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1898914076, now seen corresponding path program 1 times [2024-11-19 00:55:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:50,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993442445] [2024-11-19 00:55:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:55:50,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:55:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:55:50,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:55:50,389 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:55:50,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:55:50,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 00:55:50,393 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:55:50,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:55:50,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:55:50 BoogieIcfgContainer [2024-11-19 00:55:50,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:55:50,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:55:50,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:55:50,524 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:55:50,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:29" (3/4) ... [2024-11-19 00:55:50,527 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:55:50,528 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:55:50,528 INFO L158 Benchmark]: Toolchain (without parser) took 22308.64ms. Allocated memory was 182.5MB in the beginning and 589.3MB in the end (delta: 406.8MB). Free memory was 114.7MB in the beginning and 219.6MB in the end (delta: -104.9MB). Peak memory consumption was 303.3MB. Max. memory is 16.1GB. [2024-11-19 00:55:50,528 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:55:50,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.63ms. Allocated memory is still 182.5MB. Free memory was 114.4MB in the beginning and 153.7MB in the end (delta: -39.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-19 00:55:50,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.12ms. Allocated memory is still 182.5MB. Free memory was 153.0MB in the beginning and 148.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:55:50,531 INFO L158 Benchmark]: Boogie Preprocessor took 104.82ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 143.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:55:50,531 INFO L158 Benchmark]: RCFGBuilder took 754.95ms. Allocated memory is still 182.5MB. Free memory was 143.3MB in the beginning and 97.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-19 00:55:50,531 INFO L158 Benchmark]: TraceAbstraction took 21020.06ms. Allocated memory was 182.5MB in the beginning and 589.3MB in the end (delta: 406.8MB). Free memory was 96.5MB in the beginning and 219.6MB in the end (delta: -123.1MB). Peak memory consumption was 285.2MB. Max. memory is 16.1GB. [2024-11-19 00:55:50,531 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 589.3MB. Free memory is still 219.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:55:50,532 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.13ms. Allocated memory is still 104.9MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.63ms. Allocated memory is still 182.5MB. Free memory was 114.4MB in the beginning and 153.7MB in the end (delta: -39.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.12ms. Allocated memory is still 182.5MB. Free memory was 153.0MB in the beginning and 148.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.82ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 143.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 754.95ms. Allocated memory is still 182.5MB. Free memory was 143.3MB in the beginning and 97.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21020.06ms. Allocated memory was 182.5MB in the beginning and 589.3MB in the end (delta: 406.8MB). Free memory was 96.5MB in the beginning and 219.6MB in the end (delta: -123.1MB). Peak memory consumption was 285.2MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 589.3MB. Free memory is still 219.6MB. 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 96, overapproximation of someUnaryDOUBLEoperation at line 32. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L22] signed short int var_1_1 = -10; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_5 = 4; [L24] signed short int var_1_5 = 4; [L25] signed short int* var_1_5_Pointer = &(var_1_5); [L26] unsigned char var_1_7 = 200; [L26] unsigned char var_1_7 = 200; [L27] unsigned char* var_1_7_Pointer = &(var_1_7); [L28] unsigned char var_1_8 = 32; [L28] unsigned char var_1_8 = 32; [L29] unsigned char* var_1_8_Pointer = &(var_1_8); [L30] float var_1_9 = 256.5; [L30] float var_1_9 = 256.5; [L31] float* var_1_9_Pointer = &(var_1_9); [L32] float var_1_10 = -0.25; [L32] float var_1_10 = -0.25; [L33] float* var_1_10_Pointer = &(var_1_10); [L34] float var_1_11 = 0.30000000000000004; [L34] float var_1_11 = 0.30000000000000004; [L35] float* var_1_11_Pointer = &(var_1_11); [L36] float var_1_12 = 49.5; [L36] float var_1_12 = 49.5; [L37] float* var_1_12_Pointer = &(var_1_12); [L38] signed long int var_1_13 = -8; [L38] signed long int var_1_13 = -8; [L39] signed long int* var_1_13_Pointer = &(var_1_13); [L40] unsigned char var_1_14 = 0; [L40] unsigned char var_1_14 = 0; [L41] unsigned char* var_1_14_Pointer = &(var_1_14); [L42] float var_1_15 = 0.4; [L42] float var_1_15 = 0.4; [L43] float* var_1_15_Pointer = &(var_1_15); [L44] signed long int var_1_16 = -256; [L44] signed long int var_1_16 = -256; [L45] signed long int* var_1_16_Pointer = &(var_1_16); [L46] signed long int last_1_var_1_13 = -8; VAL [isInitial=0, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] EXPR \read(var_1_13) [L93] last_1_var_1_13 = var_1_13 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L76] var_1_5 = __VERIFIER_nondet_short() [L77] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] var_1_8 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] var_1_10 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] 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_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] 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_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] 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_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] 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_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] var_1_11 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_11) [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F [L85] EXPR \read(var_1_11) [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] var_1_12 = __VERIFIER_nondet_float() [L87] EXPR \read(var_1_12) [L87] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L87] EXPR \read(var_1_12) [L87] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] var_1_14 = __VERIFIER_nondet_uchar() [L89] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] RET updateVariables() [L105] CALL step() [L50] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L50] COND FALSE !((*(var_1_5_Pointer)) < last_1_var_1_13) [L53] EXPR \read(*var_1_7_Pointer) [L53] (*(var_1_16_Pointer)) = (*(var_1_7_Pointer)) [L54] EXPR \read(*var_1_7_Pointer) [L54] unsigned char stepLocal_1 = (*(var_1_7_Pointer)); [L55] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L55] COND TRUE ! (*(var_1_14_Pointer)) [L56] EXPR \read(*var_1_8_Pointer) [L56] (*(var_1_13_Pointer)) = (*(var_1_8_Pointer)) [L64] EXPR \read(*var_1_11_Pointer) [L64] (*(var_1_15_Pointer)) = (*(var_1_11_Pointer)) [L65] EXPR \read(*var_1_13_Pointer) [L65] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L65] EXPR (*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L65] EXPR \read(*var_1_16_Pointer) [L65] signed long int stepLocal_0 = ((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer)); [L66] COND FALSE !(stepLocal_0 < -1) [L69] EXPR \read(*var_1_7_Pointer) [L69] EXPR \read(*var_1_7_Pointer) [L69] (*(var_1_1_Pointer)) = (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) [L71] EXPR \read(*var_1_7_Pointer) [L71] EXPR \read(*var_1_13_Pointer) [L71] EXPR \read(*var_1_7_Pointer) [L71] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L71] EXPR (*(var_1_7_Pointer)) | (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L71] EXPR (*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L71] COND FALSE !((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR \read(*var_1_13_Pointer) [L96] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR ((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))))) [L96] EXPR \read(*var_1_1_Pointer) [L96] EXPR \read(*var_1_7_Pointer) [L96] EXPR \read(*var_1_7_Pointer) [L96] EXPR ((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1) [L96] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR ((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1 [L96] EXPR ((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1 VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR ((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR ((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1) [L96] EXPR \read(*var_1_7_Pointer) [L96] EXPR \read(*var_1_13_Pointer) [L96] EXPR \read(*var_1_7_Pointer) [L96] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (*(var_1_7_Pointer)) | (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR ((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1 [L96] EXPR ((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1 VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR ((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))))) [L96] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) [L96] EXPR \read(*var_1_13_Pointer) [L96] EXPR \read(*var_1_8_Pointer) [L96] EXPR (! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR ((((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR ((((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_11_Pointer)))) [L96] EXPR \read(*var_1_15_Pointer) [L96] EXPR \read(*var_1_11_Pointer) [L96] EXPR ((((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (((((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_11_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (((((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_11_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96-L97] return (((((((((*(var_1_13_Pointer)) ^ (*(var_1_7_Pointer))) + (*(var_1_16_Pointer))) < -1) ? ((*(var_1_1_Pointer)) == ((signed short int) 8)) : ((*(var_1_1_Pointer)) == ((signed short int) (128 - ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer))))))) && (((*(var_1_5_Pointer)) < last_1_var_1_13) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_8_Pointer)) + 1))) : 1)) && (((*(var_1_7_Pointer)) < ((*(var_1_13_Pointer)) & ((*(var_1_7_Pointer)) | (*(var_1_16_Pointer))))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) < 0 ) ? -((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))) : ((*(var_1_10_Pointer)) + ((*(var_1_11_Pointer)) - (*(var_1_12_Pointer)))))))) : 1)) && ((! (*(var_1_14_Pointer))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : (((*(var_1_7_Pointer)) > ((*(var_1_7_Pointer)) + (*(var_1_7_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_11_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 32, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6693 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6693 mSDsluCounter, 37079 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30748 mSDsCounter, 445 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10267 IncrementalHoareTripleChecker+Invalid, 10712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 445 mSolverCounterUnsat, 6331 mSDtfsCounter, 10267 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 882 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=716occurred in iteration=19, InterpolantAutomatonStates: 276, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 6261 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3635 NumberOfCodeBlocks, 3635 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3591 ConstructedInterpolants, 0 QuantifiedInterpolants, 9697 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1933 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 36 InterpolantComputations, 30 PerfectInterpolantSequences, 5060/5184 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-19 00:55:50,572 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-33.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 24eb6d8aed88d8ad0c0a7297311d178ed920bbbfb0b7ffdf6d456efc32725bc4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:55:53,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:55:53,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:55:53,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:55:53,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:55:53,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:55:53,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:55:53,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:55:53,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:55:53,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:55:53,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:55:53,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:55:53,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:55:53,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:55:53,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:55:53,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:55:53,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:55:53,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:55:53,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:55:53,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:55:53,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:55:53,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:55:53,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:55:53,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:55:53,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:55:53,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:55:53,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:55:53,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:55:53,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:55:53,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:55:53,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:55:53,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:55:53,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:55:53,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:55:53,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:55:53,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:55:53,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:55:53,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:55:53,140 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:55:53,140 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:55:53,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:55:53,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:55:53,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:55:53,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:55:53,141 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 -> 24eb6d8aed88d8ad0c0a7297311d178ed920bbbfb0b7ffdf6d456efc32725bc4 [2024-11-19 00:55:53,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:55:53,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:55:53,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:55:53,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:55:53,427 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:55:53,428 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-33.i [2024-11-19 00:55:54,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:55:55,030 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:55:55,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-33.i [2024-11-19 00:55:55,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28787462d/44e4affdf24848f499b4caf7d813e380/FLAG5f9cfbf3c [2024-11-19 00:55:55,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28787462d/44e4affdf24848f499b4caf7d813e380 [2024-11-19 00:55:55,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:55:55,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:55:55,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:55:55,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:55:55,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:55:55,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2d97e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55, skipping insertion in model container [2024-11-19 00:55:55,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:55:55,708 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-33.i[916,929] [2024-11-19 00:55:55,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:55:55,780 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:55:55,791 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-33.i[916,929] [2024-11-19 00:55:55,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:55:55,841 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:55:55,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55 WrapperNode [2024-11-19 00:55:55,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:55:55,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:55:55,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:55:55,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:55:55,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,899 INFO L138 Inliner]: procedures = 36, calls = 147, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-11-19 00:55:55,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:55:55,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:55:55,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:55:55,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:55:55,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,954 INFO L175 MemorySlicer]: Split 115 memory accesses to 13 slices as follows [2, 5, 6, 23, 8, 3, 12, 14, 12, 12, 6, 3, 9]. 20 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1]. [2024-11-19 00:55:55,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:55,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:56,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:56,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:55:56,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:55:56,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:55:56,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:55:56,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (1/1) ... [2024-11-19 00:55:56,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:55:56,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:56,055 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-19 00:55:56,061 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-19 00:55:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:55:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:55:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:55:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:55:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:55:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:55:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:55:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:55:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 00:55:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 00:55:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 00:55:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 00:55:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 00:55:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 00:55:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:55:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:55:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:55:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:55:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-19 00:55:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:55:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:55:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:55:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 00:55:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 00:55:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:55:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:55:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:55:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:55:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:55:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:55:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 00:55:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 00:55:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-19 00:55:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-19 00:55:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-19 00:55:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-19 00:55:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-19 00:55:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-19 00:55:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-19 00:55:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-19 00:55:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-19 00:55:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-19 00:55:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-19 00:55:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-19 00:55:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-19 00:55:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:55:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:55:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:55:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:55:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:55:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:55:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:55:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:55:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 00:55:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:55:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:55:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:55:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:55:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:55:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:55:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 00:55:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-19 00:55:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-19 00:55:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-19 00:55:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-19 00:55:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-19 00:55:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-19 00:55:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:55:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:55:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:55:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-19 00:55:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-19 00:55:56,343 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:55:56,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:55:59,134 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-19 00:55:59,135 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:55:59,147 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:55:59,147 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:55:59,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:59 BoogieIcfgContainer [2024-11-19 00:55:59,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:55:59,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:55:59,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:55:59,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:55:59,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:55:55" (1/3) ... [2024-11-19 00:55:59,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ba7a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:55:59, skipping insertion in model container [2024-11-19 00:55:59,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:55" (2/3) ... [2024-11-19 00:55:59,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ba7a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:55:59, skipping insertion in model container [2024-11-19 00:55:59,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:59" (3/3) ... [2024-11-19 00:55:59,160 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-33.i [2024-11-19 00:55:59,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:55:59,182 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:55:59,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:55:59,266 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;@1cebedbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:55:59,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:55:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 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-19 00:55:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:55:59,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:59,278 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-19 00:55:59,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash -757554800, now seen corresponding path program 1 times [2024-11-19 00:55:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912826621] [2024-11-19 00:55:59,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:59,296 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-19 00:55:59,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:59,298 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-19 00:55:59,299 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-19 00:55:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:59,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:55:59,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-19 00:55:59,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:59,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:55:59,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912826621] [2024-11-19 00:55:59,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912826621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:59,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:59,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:55:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502679661] [2024-11-19 00:55:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:59,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:55:59,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:55:59,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:55:59,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:55:59,684 INFO L87 Difference]: Start difference. First operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:55:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:59,710 INFO L93 Difference]: Finished difference Result 163 states and 247 transitions. [2024-11-19 00:55:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:55:59,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-19 00:55:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:59,719 INFO L225 Difference]: With dead ends: 163 [2024-11-19 00:55:59,719 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 00:55:59,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-19 00:55:59,724 INFO L432 NwaCegarLoop]: 115 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, 115 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-19 00:55:59,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 00:55:59,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-19 00:55:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 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-19 00:55:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-19 00:55:59,754 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 92 [2024-11-19 00:55:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:59,755 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-19 00:55:59,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:55:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-19 00:55:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:55:59,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:59,758 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-19 00:55:59,768 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-19 00:55:59,958 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-19 00:55:59,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1180114542, now seen corresponding path program 1 times [2024-11-19 00:55:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196152670] [2024-11-19 00:55:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:59,962 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-19 00:55:59,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:59,963 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-19 00:55:59,965 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-19 00:56:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:00,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:56:00,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 00:56:00,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:00,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196152670] [2024-11-19 00:56:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196152670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:00,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:00,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:56:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925660530] [2024-11-19 00:56:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:00,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:56:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:56:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:56:00,386 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:56:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:00,425 INFO L93 Difference]: Finished difference Result 161 states and 230 transitions. [2024-11-19 00:56:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:56:00,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-19 00:56:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:00,427 INFO L225 Difference]: With dead ends: 161 [2024-11-19 00:56:00,427 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 00:56:00,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:56:00,429 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:00,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 00:56:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-19 00:56:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 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-19 00:56:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-19 00:56:00,443 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 92 [2024-11-19 00:56:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:00,444 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-19 00:56:00,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:56:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-19 00:56:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:56:00,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:00,448 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-19 00:56:00,457 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-19 00:56:00,648 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-19 00:56:00,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:00,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2073600880, now seen corresponding path program 1 times [2024-11-19 00:56:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19556669] [2024-11-19 00:56:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:00,652 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-19 00:56:00,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:00,654 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-19 00:56:00,655 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-19 00:56:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:00,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:56:00,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:01,579 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-19 00:56:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:56:02,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:03,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:03,007 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 21 treesize of output 24 [2024-11-19 00:56:03,232 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-19 00:56:03,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19556669] [2024-11-19 00:56:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19556669] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:56:03,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:56:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-19 00:56:03,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497156531] [2024-11-19 00:56:03,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:56:03,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:56:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:03,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:56:03,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:56:03,235 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 17 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:56:06,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:56:09,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:56:13,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:56:14,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:56:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:15,120 INFO L93 Difference]: Finished difference Result 252 states and 353 transitions. [2024-11-19 00:56:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:56:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 92 [2024-11-19 00:56:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:15,123 INFO L225 Difference]: With dead ends: 252 [2024-11-19 00:56:15,123 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 00:56:15,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-11-19 00:56:15,126 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 498 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 54 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:15,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1146 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 347 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2024-11-19 00:56:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 00:56:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 130. [2024-11-19 00:56:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:56:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 180 transitions. [2024-11-19 00:56:15,154 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 180 transitions. Word has length 92 [2024-11-19 00:56:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:15,154 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 180 transitions. [2024-11-19 00:56:15,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:56:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2024-11-19 00:56:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:56:15,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:15,156 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-19 00:56:15,170 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-19 00:56:15,356 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-19 00:56:15,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:15,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash 415928082, now seen corresponding path program 1 times [2024-11-19 00:56:15,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:15,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468945716] [2024-11-19 00:56:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:15,361 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-19 00:56:15,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:15,363 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-19 00:56:15,364 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-19 00:56:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:15,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:56:15,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:15,599 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-19 00:56:15,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:56:15,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 00:56:15,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-11-19 00:56:15,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 00:56:15,687 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 25 treesize of output 17 [2024-11-19 00:56:15,719 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-19 00:56:15,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:15,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468945716] [2024-11-19 00:56:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468945716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836965776] [2024-11-19 00:56:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:15,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:15,721 INFO L87 Difference]: Start difference. First operand 130 states and 180 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-19 00:56:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:15,942 INFO L93 Difference]: Finished difference Result 213 states and 299 transitions. [2024-11-19 00:56:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:15,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-19 00:56:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:15,945 INFO L225 Difference]: With dead ends: 213 [2024-11-19 00:56:15,945 INFO L226 Difference]: Without dead ends: 133 [2024-11-19 00:56:15,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:15,947 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 196 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:15,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 368 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-19 00:56:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-19 00:56:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:56:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-19 00:56:15,959 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 92 [2024-11-19 00:56:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:15,960 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-19 00:56:15,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-19 00:56:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-19 00:56:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:56:15,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:15,961 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-19 00:56:15,973 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-19 00:56:16,163 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-19 00:56:16,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:16,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1273015660, now seen corresponding path program 1 times [2024-11-19 00:56:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734003696] [2024-11-19 00:56:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:16,165 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-19 00:56:16,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:16,169 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-19 00:56:16,174 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-19 00:56:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:16,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:56:16,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:16,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:56:16,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 00:56:16,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:56:16,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 00:56:16,528 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-19 00:56:16,535 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-19 00:56:16,562 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-19 00:56:16,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:16,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:16,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734003696] [2024-11-19 00:56:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734003696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:16,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:16,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337818110] [2024-11-19 00:56:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:16,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:16,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:16,566 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-19 00:56:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:16,710 INFO L93 Difference]: Finished difference Result 213 states and 297 transitions. [2024-11-19 00:56:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:16,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-19 00:56:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:16,712 INFO L225 Difference]: With dead ends: 213 [2024-11-19 00:56:16,712 INFO L226 Difference]: Without dead ends: 133 [2024-11-19 00:56:16,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:16,713 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 103 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:16,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 440 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-19 00:56:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-19 00:56:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3148148148148149) internal successors, (142), 108 states have internal predecessors, (142), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:56:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2024-11-19 00:56:16,724 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 92 [2024-11-19 00:56:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:16,725 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2024-11-19 00:56:16,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-19 00:56:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2024-11-19 00:56:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:56:16,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:16,726 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-19 00:56:16,736 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 (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:16,927 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-19 00:56:16,927 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:16,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1742087958, now seen corresponding path program 1 times [2024-11-19 00:56:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016841132] [2024-11-19 00:56:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:16,929 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-19 00:56:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:16,930 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-19 00:56:16,932 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-19 00:56:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:17,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:56:17,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:17,367 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 24 treesize of output 20 [2024-11-19 00:56:17,428 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 75 treesize of output 63 [2024-11-19 00:56:17,431 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 81 treesize of output 61 [2024-11-19 00:56:17,450 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-19 00:56:17,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:17,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:17,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016841132] [2024-11-19 00:56:17,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016841132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:17,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:17,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156999915] [2024-11-19 00:56:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:17,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:56:17,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:17,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:56:17,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:17,452 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 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-19 00:56:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:17,645 INFO L93 Difference]: Finished difference Result 295 states and 409 transitions. [2024-11-19 00:56:17,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:56:17,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 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-19 00:56:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:17,647 INFO L225 Difference]: With dead ends: 295 [2024-11-19 00:56:17,647 INFO L226 Difference]: Without dead ends: 215 [2024-11-19 00:56:17,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:17,648 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 162 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:17,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 604 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-19 00:56:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 208. [2024-11-19 00:56:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 176 states have (on average 1.3295454545454546) internal successors, (234), 176 states have internal predecessors, (234), 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-19 00:56:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 288 transitions. [2024-11-19 00:56:17,663 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 288 transitions. Word has length 92 [2024-11-19 00:56:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:17,664 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 288 transitions. [2024-11-19 00:56:17,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 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-19 00:56:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 288 transitions. [2024-11-19 00:56:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 00:56:17,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:17,665 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-19 00:56:17,674 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-19 00:56:17,869 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-19 00:56:17,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:17,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:17,870 INFO L85 PathProgramCache]: Analyzing trace with hash 135257809, now seen corresponding path program 1 times [2024-11-19 00:56:17,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:17,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747482473] [2024-11-19 00:56:17,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:17,871 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-19 00:56:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:17,874 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-19 00:56:17,875 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-19 00:56:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:18,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:56:18,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:18,559 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-19 00:56:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:56:18,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:18,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:18,904 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 21 treesize of output 24 [2024-11-19 00:56:19,056 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-19 00:56:19,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747482473] [2024-11-19 00:56:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747482473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:56:19,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:56:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-19 00:56:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188264540] [2024-11-19 00:56:19,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:56:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:56:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:56:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:56:19,058 INFO L87 Difference]: Start difference. First operand 208 states and 288 transitions. Second operand has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:56:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:20,091 INFO L93 Difference]: Finished difference Result 410 states and 567 transitions. [2024-11-19 00:56:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:56:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 94 [2024-11-19 00:56:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:20,094 INFO L225 Difference]: With dead ends: 410 [2024-11-19 00:56:20,097 INFO L226 Difference]: Without dead ends: 252 [2024-11-19 00:56:20,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2024-11-19 00:56:20,098 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 304 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:20,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1035 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:56:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-19 00:56:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 222. [2024-11-19 00:56:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 190 states have internal predecessors, (252), 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-19 00:56:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 306 transitions. [2024-11-19 00:56:20,123 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 306 transitions. Word has length 94 [2024-11-19 00:56:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:20,124 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 306 transitions. [2024-11-19 00:56:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:56:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 306 transitions. [2024-11-19 00:56:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 00:56:20,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:20,125 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-19 00:56:20,136 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-19 00:56:20,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:20,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:20,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -875859441, now seen corresponding path program 1 times [2024-11-19 00:56:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474086997] [2024-11-19 00:56:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:20,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:20,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:56:20,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:56:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:20,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:56:20,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:20,597 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-19 00:56:20,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:20,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474086997] [2024-11-19 00:56:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474086997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78618815] [2024-11-19 00:56:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:20,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:20,601 INFO L87 Difference]: Start difference. First operand 222 states and 306 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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-19 00:56:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:20,654 INFO L93 Difference]: Finished difference Result 386 states and 536 transitions. [2024-11-19 00:56:20,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:20,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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-19 00:56:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:20,656 INFO L225 Difference]: With dead ends: 386 [2024-11-19 00:56:20,656 INFO L226 Difference]: Without dead ends: 228 [2024-11-19 00:56:20,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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-19 00:56:20,657 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:20,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-19 00:56:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-19 00:56:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 196 states have (on average 1.316326530612245) internal successors, (258), 196 states have internal predecessors, (258), 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-19 00:56:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 312 transitions. [2024-11-19 00:56:20,674 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 312 transitions. Word has length 94 [2024-11-19 00:56:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:20,674 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 312 transitions. [2024-11-19 00:56:20,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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-19 00:56:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 312 transitions. [2024-11-19 00:56:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:56:20,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:20,675 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-19 00:56:20,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 00:56:20,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:20,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:20,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1253560673, now seen corresponding path program 1 times [2024-11-19 00:56:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:20,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944751337] [2024-11-19 00:56:20,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:20,880 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-19 00:56:20,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:20,881 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-19 00:56:20,883 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-19 00:56:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:21,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:56:21,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:21,181 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-19 00:56:21,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:21,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:21,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944751337] [2024-11-19 00:56:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944751337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:21,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:21,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428125756] [2024-11-19 00:56:21,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:21,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:21,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:21,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:21,183 INFO L87 Difference]: Start difference. First operand 228 states and 312 transitions. Second operand has 5 states, 5 states have (on average 10.8) 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-19 00:56:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:21,218 INFO L93 Difference]: Finished difference Result 398 states and 548 transitions. [2024-11-19 00:56:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:21,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) 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-19 00:56:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:21,220 INFO L225 Difference]: With dead ends: 398 [2024-11-19 00:56:21,220 INFO L226 Difference]: Without dead ends: 234 [2024-11-19 00:56:21,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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-19 00:56:21,221 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:21,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-19 00:56:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-19 00:56:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 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-19 00:56:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 318 transitions. [2024-11-19 00:56:21,244 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 318 transitions. Word has length 96 [2024-11-19 00:56:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:21,244 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 318 transitions. [2024-11-19 00:56:21,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) 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-19 00:56:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 318 transitions. [2024-11-19 00:56:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:56:21,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:21,245 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-19 00:56:21,261 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:21,445 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-19 00:56:21,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:21,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2043975804, now seen corresponding path program 1 times [2024-11-19 00:56:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:21,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617610561] [2024-11-19 00:56:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:21,446 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-19 00:56:21,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:21,448 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-19 00:56:21,449 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-19 00:56:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:21,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:56:21,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:21,902 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-19 00:56:22,140 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-19 00:56:22,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:22,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617610561] [2024-11-19 00:56:22,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617610561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:22,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:22,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:56:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990785786] [2024-11-19 00:56:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:56:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:56:22,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:22,142 INFO L87 Difference]: Start difference. First operand 234 states and 318 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (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-19 00:56:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:22,380 INFO L93 Difference]: Finished difference Result 241 states and 324 transitions. [2024-11-19 00:56:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:22,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (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-19 00:56:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:22,383 INFO L225 Difference]: With dead ends: 241 [2024-11-19 00:56:22,383 INFO L226 Difference]: Without dead ends: 239 [2024-11-19 00:56:22,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:22,384 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 133 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:22,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 750 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-19 00:56:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2024-11-19 00:56:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 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-19 00:56:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 321 transitions. [2024-11-19 00:56:22,425 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 321 transitions. Word has length 98 [2024-11-19 00:56:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:22,426 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 321 transitions. [2024-11-19 00:56:22,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (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-19 00:56:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 321 transitions. [2024-11-19 00:56:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:56:22,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:22,426 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-19 00:56:22,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 00:56:22,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:22,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:22,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2045822846, now seen corresponding path program 1 times [2024-11-19 00:56:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415152199] [2024-11-19 00:56:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:22,628 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-19 00:56:22,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:22,631 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:56:22,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 00:56:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:22,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:56:22,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:23,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-19 00:56:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 00:56:23,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:23,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415152199] [2024-11-19 00:56:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415152199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:23,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:23,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894241125] [2024-11-19 00:56:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:56:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:56:23,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:23,079 INFO L87 Difference]: Start difference. First operand 237 states and 321 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:56:25,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:56:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:27,604 INFO L93 Difference]: Finished difference Result 448 states and 606 transitions. [2024-11-19 00:56:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-19 00:56:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:27,609 INFO L225 Difference]: With dead ends: 448 [2024-11-19 00:56:27,609 INFO L226 Difference]: Without dead ends: 240 [2024-11-19 00:56:27,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:56:27,613 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 87 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:27,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 349 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-19 00:56:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-19 00:56:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2024-11-19 00:56:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.2878048780487805) internal successors, (264), 205 states have internal predecessors, (264), 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-19 00:56:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 318 transitions. [2024-11-19 00:56:27,644 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 318 transitions. Word has length 98 [2024-11-19 00:56:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:27,645 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 318 transitions. [2024-11-19 00:56:27,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:56:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 318 transitions. [2024-11-19 00:56:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:56:27,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:27,646 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-19 00:56:27,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 00:56:27,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:27,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:27,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1265165704, now seen corresponding path program 1 times [2024-11-19 00:56:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591650189] [2024-11-19 00:56:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:27,853 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-19 00:56:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:27,854 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-19 00:56:27,857 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-19 00:56:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:28,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 00:56:28,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:29,118 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-19 00:56:29,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 89 [2024-11-19 00:56:29,346 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 135 treesize of output 75 [2024-11-19 00:56:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-19 00:56:29,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:29,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591650189] [2024-11-19 00:56:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591650189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1685905720] [2024-11-19 00:56:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:29,628 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:29,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:56:29,630 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-19 00:56:29,631 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-19 00:56:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:30,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:56:30,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:30,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-19 00:56:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 00:56:30,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1685905720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:30,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:30,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2024-11-19 00:56:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426141764] [2024-11-19 00:56:30,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:30,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:56:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:30,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:56:30,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:56:30,498 INFO L87 Difference]: Start difference. First operand 237 states and 318 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:56:33,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:56:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:33,854 INFO L93 Difference]: Finished difference Result 436 states and 585 transitions. [2024-11-19 00:56:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:33,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-19 00:56:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:33,877 INFO L225 Difference]: With dead ends: 436 [2024-11-19 00:56:33,877 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 00:56:33,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:56:33,878 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 79 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:33,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 347 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 00:56:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 00:56:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2024-11-19 00:56:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 199 states have (on average 1.2814070351758795) internal successors, (255), 199 states have internal predecessors, (255), 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-19 00:56:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 309 transitions. [2024-11-19 00:56:33,889 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 309 transitions. Word has length 100 [2024-11-19 00:56:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:33,890 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 309 transitions. [2024-11-19 00:56:33,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:56:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 309 transitions. [2024-11-19 00:56:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:56:33,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:33,895 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] [2024-11-19 00:56:33,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-19 00:56:34,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 00:56:34,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:34,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:34,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:34,301 INFO L85 PathProgramCache]: Analyzing trace with hash 614464320, now seen corresponding path program 1 times [2024-11-19 00:56:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067693206] [2024-11-19 00:56:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:34,302 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-19 00:56:34,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:34,306 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:56:34,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 00:56:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:34,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 00:56:34,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:35,324 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-19 00:56:35,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 89 [2024-11-19 00:56:35,554 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 135 treesize of output 75 [2024-11-19 00:56:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-19 00:56:35,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:35,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067693206] [2024-11-19 00:56:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067693206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1524724285] [2024-11-19 00:56:35,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:35,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:35,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:56:35,752 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:56:35,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-19 00:56:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:36,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:56:36,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:36,853 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 99 treesize of output 51 [2024-11-19 00:56:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 00:56:36,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:37,318 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 70 treesize of output 34 [2024-11-19 00:56:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 00:56:37,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1524724285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:56:37,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:56:37,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 27 [2024-11-19 00:56:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855005190] [2024-11-19 00:56:37,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:56:37,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 00:56:37,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 00:56:37,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2024-11-19 00:56:37,346 INFO L87 Difference]: Start difference. First operand 231 states and 309 transitions. Second operand has 27 states, 25 states have (on average 6.24) internal successors, (156), 26 states have internal predecessors, (156), 7 states have call successors, (26), 6 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2024-11-19 00:56:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:54,556 INFO L93 Difference]: Finished difference Result 978 states and 1269 transitions. [2024-11-19 00:56:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-19 00:56:54,564 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.24) internal successors, (156), 26 states have internal predecessors, (156), 7 states have call successors, (26), 6 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) Word has length 102 [2024-11-19 00:56:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:54,567 INFO L225 Difference]: With dead ends: 978 [2024-11-19 00:56:54,567 INFO L226 Difference]: Without dead ends: 676 [2024-11-19 00:56:54,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1868 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=881, Invalid=6091, Unknown=0, NotChecked=0, Total=6972 [2024-11-19 00:56:54,574 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 365 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:54,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1865 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2024-11-19 00:56:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-19 00:56:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 455. [2024-11-19 00:56:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 393 states have (on average 1.2391857506361323) internal successors, (487), 395 states have internal predecessors, (487), 49 states have call successors, (49), 12 states have call predecessors, (49), 12 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-19 00:56:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 585 transitions. [2024-11-19 00:56:54,648 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 585 transitions. Word has length 102 [2024-11-19 00:56:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:54,649 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 585 transitions. [2024-11-19 00:56:54,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.24) internal successors, (156), 26 states have internal predecessors, (156), 7 states have call successors, (26), 6 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2024-11-19 00:56:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 585 transitions. [2024-11-19 00:56:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:56:54,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:54,650 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] [2024-11-19 00:56:54,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-19 00:56:54,880 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:55,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:55,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:55,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:55,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1945571008, now seen corresponding path program 1 times [2024-11-19 00:56:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:55,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280438702] [2024-11-19 00:56:55,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:55,057 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-19 00:56:55,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:55,059 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:56:55,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 00:56:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:55,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:56:55,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:55,455 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-19 00:56:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 00:56:55,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:55,642 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-19 00:56:55,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280438702] [2024-11-19 00:56:55,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280438702] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:55,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:55,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-11-19 00:56:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927557282] [2024-11-19 00:56:55,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:55,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:56:55,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:55,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:56:55,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:55,645 INFO L87 Difference]: Start difference. First operand 455 states and 585 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-19 00:56:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:55,818 INFO L93 Difference]: Finished difference Result 1045 states and 1343 transitions. [2024-11-19 00:56:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:56:55,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 102 [2024-11-19 00:56:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:55,823 INFO L225 Difference]: With dead ends: 1045 [2024-11-19 00:56:55,823 INFO L226 Difference]: Without dead ends: 693 [2024-11-19 00:56:55,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:55,824 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 43 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:55,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 509 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-19 00:56:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2024-11-19 00:56:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 613 states have (on average 1.2414355628058729) internal successors, (761), 619 states have internal predecessors, (761), 57 states have call successors, (57), 16 states have call predecessors, (57), 16 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-19 00:56:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 875 transitions. [2024-11-19 00:56:55,906 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 875 transitions. Word has length 102 [2024-11-19 00:56:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:55,906 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 875 transitions. [2024-11-19 00:56:55,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-19 00:56:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 875 transitions. [2024-11-19 00:56:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:56:55,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:55,907 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] [2024-11-19 00:56:55,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:56,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:56,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:56,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash 773123370, now seen corresponding path program 1 times [2024-11-19 00:56:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454528357] [2024-11-19 00:56:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:56,109 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-19 00:56:56,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:56,115 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:56:56,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 00:56:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:56,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:56:56,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:56,952 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-19 00:56:56,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 00:56:57,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 00:56:57,174 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 30 treesize of output 18 [2024-11-19 00:56:57,178 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-19 00:56:57,183 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-19 00:56:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 5 proven. 87 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-19 00:56:57,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:57,384 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 25 treesize of output 21 [2024-11-19 00:56:57,466 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 25 treesize of output 21 [2024-11-19 00:56:57,502 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 25 treesize of output 21