./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.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 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:16:06,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:16:06,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:16:06,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:16:06,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:16:06,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:16:06,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:16:06,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:16:06,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:16:06,804 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:16:06,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:16:06,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:16:06,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:16:06,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:16:06,806 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:16:06,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:16:06,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:16:06,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:16:06,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:16:06,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:16:06,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:16:06,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:16:06,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:16:06,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:16:06,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:16:06,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:16:06,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:16:06,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:16:06,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:16:06,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:16:06,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:16:06,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:16:06,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:16:06,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:16:06,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:16:06,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:16:06,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:16:06,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:16:06,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:16:06,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:16:06,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:16:06,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:16:06,822 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 -> 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 [2024-10-13 06:16:07,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:16:07,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:16:07,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:16:07,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:16:07,159 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:16:07,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2024-10-13 06:16:08,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:16:08,937 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:16:08,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2024-10-13 06:16:08,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9635bb9/3c978d7c6c2846ed8a39f07bdf5c16fd/FLAGa69f9b7ec [2024-10-13 06:16:08,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9635bb9/3c978d7c6c2846ed8a39f07bdf5c16fd [2024-10-13 06:16:08,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:16:08,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:16:08,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:16:08,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:16:08,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:16:08,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:16:08" (1/1) ... [2024-10-13 06:16:08,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f96fa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:08, skipping insertion in model container [2024-10-13 06:16:08,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:16:08" (1/1) ... [2024-10-13 06:16:09,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:16:09,211 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2024-10-13 06:16:09,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:16:09,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:16:09,318 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2024-10-13 06:16:09,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:16:09,383 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:16:09,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09 WrapperNode [2024-10-13 06:16:09,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:16:09,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:16:09,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:16:09,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:16:09,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,443 INFO L138 Inliner]: procedures = 29, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-10-13 06:16:09,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:16:09,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:16:09,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:16:09,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:16:09,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,519 INFO L175 MemorySlicer]: Split 91 memory accesses to 10 slices as follows [2, 19, 6, 12, 12, 10, 8, 6, 8, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 2, 1, 1, 1, 1, 2, 1, 1]. [2024-10-13 06:16:09,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:16:09,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:16:09,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:16:09,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:16:09,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (1/1) ... [2024-10-13 06:16:09,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:16:09,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:16:09,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:16:09,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:16:09,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:16:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:16:09,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:16:09,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:16:09,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:16:09,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:16:09,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:16:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 06:16:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 06:16:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-13 06:16:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-13 06:16:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:16:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:16:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:16:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:16:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:16:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:16:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:16:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:16:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 06:16:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 06:16:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-13 06:16:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-13 06:16:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:16:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:16:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:16:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:16:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:16:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:16:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:16:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:16:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:16:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:16:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:16:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:16:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:16:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:16:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:16:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:16:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 06:16:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 06:16:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-13 06:16:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-13 06:16:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:16:09,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:16:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:16:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:16:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:16:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:16:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:16:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:16:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:16:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:16:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:16:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:16:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:16:09,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:16:09,870 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:16:09,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:16:10,365 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-13 06:16:10,365 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:16:10,408 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:16:10,409 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:16:10,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:16:10 BoogieIcfgContainer [2024-10-13 06:16:10,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:16:10,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:16:10,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:16:10,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:16:10,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:16:08" (1/3) ... [2024-10-13 06:16:10,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271b75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:16:10, skipping insertion in model container [2024-10-13 06:16:10,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:09" (2/3) ... [2024-10-13 06:16:10,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271b75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:16:10, skipping insertion in model container [2024-10-13 06:16:10,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:16:10" (3/3) ... [2024-10-13 06:16:10,421 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-21.i [2024-10-13 06:16:10,440 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:16:10,440 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:16:10,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:16:10,525 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;@6d05ed36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:16:10,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:16:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 06:16:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 06:16:10,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:10,544 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:10,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:10,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:10,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1647384108, now seen corresponding path program 1 times [2024-10-13 06:16:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:10,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059183172] [2024-10-13 06:16:10,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:10,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:10,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:10,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:10,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059183172] [2024-10-13 06:16:11,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059183172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:11,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:11,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:16:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284040869] [2024-10-13 06:16:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:11,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:16:11,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:11,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:16:11,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:16:11,041 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 06:16:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:11,094 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2024-10-13 06:16:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:16:11,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2024-10-13 06:16:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:11,106 INFO L225 Difference]: With dead ends: 175 [2024-10-13 06:16:11,107 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 06:16:11,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:16:11,117 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:11,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 06:16:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 06:16:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 78 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 06:16:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-10-13 06:16:11,172 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 75 [2024-10-13 06:16:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:11,174 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-10-13 06:16:11,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 06:16:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-10-13 06:16:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 06:16:11,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:11,180 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:11,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:16:11,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:11,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1170950670, now seen corresponding path program 1 times [2024-10-13 06:16:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840643326] [2024-10-13 06:16:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:11,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:11,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:12,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:12,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840643326] [2024-10-13 06:16:12,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840643326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:12,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:12,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:16:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178737965] [2024-10-13 06:16:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:12,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:16:12,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:12,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:16:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:16:12,041 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:12,274 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2024-10-13 06:16:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:16:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2024-10-13 06:16:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:12,278 INFO L225 Difference]: With dead ends: 289 [2024-10-13 06:16:12,279 INFO L226 Difference]: Without dead ends: 203 [2024-10-13 06:16:12,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:16:12,282 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 232 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:12,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 667 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:16:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-13 06:16:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2024-10-13 06:16:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.4625) internal successors, (234), 160 states have internal predecessors, (234), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:16:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2024-10-13 06:16:12,321 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 75 [2024-10-13 06:16:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:12,321 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2024-10-13 06:16:12,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2024-10-13 06:16:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-13 06:16:12,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:12,325 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:12,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:16:12,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:12,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2088746051, now seen corresponding path program 1 times [2024-10-13 06:16:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186344816] [2024-10-13 06:16:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:12,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186344816] [2024-10-13 06:16:12,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186344816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:12,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:12,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:16:12,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611115634] [2024-10-13 06:16:12,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:12,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:16:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:16:12,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:12,544 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:12,585 INFO L93 Difference]: Finished difference Result 356 states and 527 transitions. [2024-10-13 06:16:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:16:12,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 78 [2024-10-13 06:16:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:12,588 INFO L225 Difference]: With dead ends: 356 [2024-10-13 06:16:12,589 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 06:16:12,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:12,591 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:12,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 06:16:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-13 06:16:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.4478527607361964) internal successors, (236), 163 states have internal predecessors, (236), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:16:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2024-10-13 06:16:12,619 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 78 [2024-10-13 06:16:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:12,620 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2024-10-13 06:16:12,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2024-10-13 06:16:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 06:16:12,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:12,622 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:12,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:16:12,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:12,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1731782028, now seen corresponding path program 1 times [2024-10-13 06:16:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:12,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326757398] [2024-10-13 06:16:12,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:13,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326757398] [2024-10-13 06:16:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326757398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:13,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:13,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:16:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103566285] [2024-10-13 06:16:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:13,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:16:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:16:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:16:13,128 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:13,263 INFO L93 Difference]: Finished difference Result 475 states and 688 transitions. [2024-10-13 06:16:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:16:13,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2024-10-13 06:16:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:13,265 INFO L225 Difference]: With dead ends: 475 [2024-10-13 06:16:13,268 INFO L226 Difference]: Without dead ends: 296 [2024-10-13 06:16:13,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:16:13,270 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:13,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 870 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:16:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-13 06:16:13,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-10-13 06:16:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 267 states have (on average 1.4232209737827715) internal successors, (380), 269 states have internal predecessors, (380), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:16:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2024-10-13 06:16:13,302 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 82 [2024-10-13 06:16:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:13,303 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2024-10-13 06:16:13,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2024-10-13 06:16:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 06:16:13,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:13,309 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:13,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:16:13,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:13,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1507292681, now seen corresponding path program 1 times [2024-10-13 06:16:13,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:13,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371175037] [2024-10-13 06:16:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:13,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:13,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371175037] [2024-10-13 06:16:13,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371175037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:13,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:13,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:16:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459645077] [2024-10-13 06:16:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:13,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:16:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:13,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:16:13,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:16:13,550 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:13,617 INFO L93 Difference]: Finished difference Result 306 states and 437 transitions. [2024-10-13 06:16:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:16:13,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-13 06:16:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:13,621 INFO L225 Difference]: With dead ends: 306 [2024-10-13 06:16:13,621 INFO L226 Difference]: Without dead ends: 304 [2024-10-13 06:16:13,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:16:13,625 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:13,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 718 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:16:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-13 06:16:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-13 06:16:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 281 states have internal predecessors, (392), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:16:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 432 transitions. [2024-10-13 06:16:13,648 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 432 transitions. Word has length 84 [2024-10-13 06:16:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:13,649 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 432 transitions. [2024-10-13 06:16:13,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 432 transitions. [2024-10-13 06:16:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 06:16:13,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:13,653 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:13,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:16:13,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:13,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:13,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1768933794, now seen corresponding path program 1 times [2024-10-13 06:16:13,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:13,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146244166] [2024-10-13 06:16:13,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146244166] [2024-10-13 06:16:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146244166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:16:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844025311] [2024-10-13 06:16:13,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:13,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:16:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:16:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:16:13,774 INFO L87 Difference]: Start difference. First operand 304 states and 432 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:13,814 INFO L93 Difference]: Finished difference Result 610 states and 869 transitions. [2024-10-13 06:16:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:16:13,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-13 06:16:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:13,818 INFO L225 Difference]: With dead ends: 610 [2024-10-13 06:16:13,818 INFO L226 Difference]: Without dead ends: 307 [2024-10-13 06:16:13,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:16:13,821 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:13,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-13 06:16:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-10-13 06:16:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 282 states have (on average 1.400709219858156) internal successors, (395), 284 states have internal predecessors, (395), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:16:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 435 transitions. [2024-10-13 06:16:13,840 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 435 transitions. Word has length 84 [2024-10-13 06:16:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:13,841 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 435 transitions. [2024-10-13 06:16:13,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 435 transitions. [2024-10-13 06:16:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 06:16:13,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:13,844 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:13,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:16:13,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1504965148, now seen corresponding path program 1 times [2024-10-13 06:16:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812135806] [2024-10-13 06:16:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:14,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812135806] [2024-10-13 06:16:14,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812135806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:14,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:14,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:16:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991166876] [2024-10-13 06:16:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:16:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:16:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:16:14,341 INFO L87 Difference]: Start difference. First operand 307 states and 435 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:14,756 INFO L93 Difference]: Finished difference Result 1214 states and 1727 transitions. [2024-10-13 06:16:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:16:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-13 06:16:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:14,762 INFO L225 Difference]: With dead ends: 1214 [2024-10-13 06:16:14,762 INFO L226 Difference]: Without dead ends: 908 [2024-10-13 06:16:14,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:16:14,766 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 483 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:14,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1416 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:16:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-10-13 06:16:14,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 615. [2024-10-13 06:16:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 566 states have (on average 1.4063604240282686) internal successors, (796), 570 states have internal predecessors, (796), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 06:16:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 876 transitions. [2024-10-13 06:16:14,802 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 876 transitions. Word has length 84 [2024-10-13 06:16:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:14,803 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 876 transitions. [2024-10-13 06:16:14,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 876 transitions. [2024-10-13 06:16:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:16:14,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:14,804 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:14,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:16:14,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:14,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:14,805 INFO L85 PathProgramCache]: Analyzing trace with hash 584576232, now seen corresponding path program 1 times [2024-10-13 06:16:14,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:14,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970957648] [2024-10-13 06:16:14,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:14,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970957648] [2024-10-13 06:16:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970957648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:15,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:16:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991480113] [2024-10-13 06:16:15,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:15,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:16:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:16:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:15,015 INFO L87 Difference]: Start difference. First operand 615 states and 876 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:15,134 INFO L93 Difference]: Finished difference Result 1592 states and 2266 transitions. [2024-10-13 06:16:15,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:16:15,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-13 06:16:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:15,139 INFO L225 Difference]: With dead ends: 1592 [2024-10-13 06:16:15,139 INFO L226 Difference]: Without dead ends: 978 [2024-10-13 06:16:15,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:16:15,141 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 186 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:15,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 571 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:16:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-13 06:16:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 932. [2024-10-13 06:16:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 859 states have (on average 1.3958090803259604) internal successors, (1199), 865 states have internal predecessors, (1199), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:16:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1319 transitions. [2024-10-13 06:16:15,209 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1319 transitions. Word has length 85 [2024-10-13 06:16:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:15,210 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1319 transitions. [2024-10-13 06:16:15,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1319 transitions. [2024-10-13 06:16:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:16:15,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:15,211 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:15,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:16:15,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:15,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 455287976, now seen corresponding path program 1 times [2024-10-13 06:16:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078588668] [2024-10-13 06:16:15,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:16:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:16:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:16:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:16:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:16:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:16:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:16:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:16:15,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078588668] [2024-10-13 06:16:15,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078588668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:15,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:16:15,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496208167] [2024-10-13 06:16:15,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:15,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:16:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:16:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:16:15,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:16:15,397 INFO L87 Difference]: Start difference. First operand 932 states and 1319 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:15,486 INFO L93 Difference]: Finished difference Result 1879 states and 2651 transitions. [2024-10-13 06:16:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:16:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-13 06:16:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:15,492 INFO L225 Difference]: With dead ends: 1879 [2024-10-13 06:16:15,492 INFO L226 Difference]: Without dead ends: 969 [2024-10-13 06:16:15,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:16:15,494 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:15,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 834 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:16:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-10-13 06:16:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 951. [2024-10-13 06:16:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 878 states have (on average 1.3861047835990887) internal successors, (1217), 884 states have internal predecessors, (1217), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:16:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1337 transitions. [2024-10-13 06:16:15,530 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1337 transitions. Word has length 85 [2024-10-13 06:16:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:15,531 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1337 transitions. [2024-10-13 06:16:15,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1337 transitions. [2024-10-13 06:16:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:16:15,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:15,532 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:15,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:16:15,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:15,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1190243658, now seen corresponding path program 1 times [2024-10-13 06:16:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:16:15,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112263830] [2024-10-13 06:16:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:16:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:16:15,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844820959] [2024-10-13 06:16:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:15,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:16:15,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:16:15,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:16:15,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:16:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:16:15,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:16:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:16:16,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:16:16,093 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:16:16,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:16:16,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:16:16,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 06:16:16,300 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:16,450 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:16:16,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:16:16 BoogieIcfgContainer [2024-10-13 06:16:16,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:16:16,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:16:16,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:16:16,454 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:16:16,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:16:10" (3/4) ... [2024-10-13 06:16:16,457 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:16:16,458 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:16:16,458 INFO L158 Benchmark]: Toolchain (without parser) took 7492.32ms. Allocated memory was 146.8MB in the beginning and 249.6MB in the end (delta: 102.8MB). Free memory was 93.5MB in the beginning and 203.6MB in the end (delta: -110.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:16:16,458 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 146.8MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:16:16,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.86ms. Allocated memory is still 146.8MB. Free memory was 93.5MB in the beginning and 78.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 06:16:16,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.05ms. Allocated memory is still 146.8MB. Free memory was 78.4MB in the beginning and 75.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:16:16,459 INFO L158 Benchmark]: Boogie Preprocessor took 113.91ms. Allocated memory is still 146.8MB. Free memory was 75.3MB in the beginning and 70.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:16:16,459 INFO L158 Benchmark]: RCFGBuilder took 849.92ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 70.4MB in the beginning and 149.4MB in the end (delta: -79.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-13 06:16:16,460 INFO L158 Benchmark]: TraceAbstraction took 6041.16ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 149.4MB in the beginning and 203.6MB in the end (delta: -54.2MB). Peak memory consumption was 119.8MB. Max. memory is 16.1GB. [2024-10-13 06:16:16,460 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 249.6MB. Free memory is still 203.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:16:16,461 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.27ms. Allocated memory is still 146.8MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.86ms. Allocated memory is still 146.8MB. Free memory was 93.5MB in the beginning and 78.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.05ms. Allocated memory is still 146.8MB. Free memory was 78.4MB in the beginning and 75.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.91ms. Allocated memory is still 146.8MB. Free memory was 75.3MB in the beginning and 70.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 849.92ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 70.4MB in the beginning and 149.4MB in the end (delta: -79.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6041.16ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 149.4MB in the beginning and 203.6MB in the end (delta: -54.2MB). Peak memory consumption was 119.8MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 249.6MB. Free memory is still 203.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 someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L22] unsigned short int var_1_1 = 32; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_7 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned char* var_1_7_Pointer = &(var_1_7); [L26] double var_1_8 = 15.6; [L26] double var_1_8 = 15.6; [L27] double* var_1_8_Pointer = &(var_1_8); [L28] double var_1_9 = 15.4; [L28] double var_1_9 = 15.4; [L29] double* var_1_9_Pointer = &(var_1_9); [L30] double var_1_10 = 32.2; [L30] double var_1_10 = 32.2; [L31] double* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_12 = 1; [L32] unsigned char var_1_12 = 1; [L33] unsigned char* var_1_12_Pointer = &(var_1_12); [L34] signed short int var_1_13 = 256; [L34] signed short int var_1_13 = 256; [L35] signed short int* var_1_13_Pointer = &(var_1_13); [L36] float var_1_14 = 5.75; [L36] float var_1_14 = 5.75; [L37] float* var_1_14_Pointer = &(var_1_14); [L38] float var_1_15 = 8.6; [L38] float var_1_15 = 8.6; [L39] float* var_1_15_Pointer = &(var_1_15); [L40] unsigned char last_1_var_1_7 = 0; [L41] signed short int last_1_var_1_13 = 256; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] EXPR \read(var_1_7) [L85] last_1_var_1_7 = var_1_7 [L86] EXPR \read(var_1_13) [L86] last_1_var_1_13 = var_1_13 [L96] RET updateLastVariables() [L97] CALL updateVariables() [L70] var_1_8 = __VERIFIER_nondet_double() [L71] EXPR \read(var_1_8) [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L71] EXPR \read(var_1_8) [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L72] var_1_9 = __VERIFIER_nondet_double() [L73] EXPR \read(var_1_9) [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L73] EXPR \read(var_1_9) [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L74] var_1_10 = __VERIFIER_nondet_double() [L75] EXPR \read(var_1_10) [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F [L75] EXPR \read(var_1_10) [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] var_1_14 = __VERIFIER_nondet_float() [L80] EXPR \read(var_1_14) [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L80] EXPR \read(var_1_14) [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] var_1_15 = __VERIFIER_nondet_float() [L82] EXPR \read(var_1_15) [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L82] EXPR \read(var_1_15) [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] RET updateVariables() [L98] CALL step() [L45] COND TRUE (last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L46] COND FALSE !(last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L54] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L54] COND TRUE (*(var_1_12_Pointer)) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR \read(*var_1_15_Pointer) [L55] EXPR \read(*var_1_8_Pointer) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L55] COND FALSE !(((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) [L58] EXPR \read(*var_1_1_Pointer) [L58] (*(var_1_13_Pointer)) = (*(var_1_1_Pointer)) [L61] EXPR \read(*var_1_8_Pointer) [L61] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) [L61] EXPR \read(*var_1_8_Pointer) [L61] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] COND TRUE (((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer)) [L62] last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L62] last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L62] COND FALSE !(last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1 [L89] EXPR (last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) [L89] EXPR \read(*var_1_8_Pointer) [L89] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) [L89] EXPR \read(*var_1_8_Pointer) [L89] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) [L89] EXPR \read(*var_1_7_Pointer) [L89] EXPR \read(*var_1_12_Pointer) [L89] EXPR ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89-L90] return ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 972 mSDsluCounter, 5930 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4670 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 682 IncrementalHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 1260 mSDtfsCounter, 682 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 387 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 723 ConstructedInterpolants, 0 QuantifiedInterpolants, 1564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 756/756 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:16:16,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.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 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:16:18,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:16:18,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:16:18,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:16:18,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:16:18,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:16:18,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:16:18,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:16:18,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:16:18,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:16:18,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:16:18,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:16:18,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:16:18,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:16:18,901 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:16:18,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:16:18,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:16:18,902 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:16:18,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:16:18,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:16:18,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:16:18,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:16:18,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:16:18,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:16:18,907 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:16:18,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:16:18,907 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:16:18,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:16:18,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:16:18,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:16:18,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:16:18,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:16:18,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:16:18,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:16:18,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:16:18,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:16:18,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:16:18,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:16:18,912 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:16:18,912 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:16:18,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:16:18,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:16:18,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:16:18,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:16:18,913 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:16:18,914 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 -> 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 [2024-10-13 06:16:19,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:16:19,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:16:19,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:16:19,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:16:19,316 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:16:19,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2024-10-13 06:16:20,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:16:21,115 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:16:21,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2024-10-13 06:16:21,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/630df75f5/a86de9ca07354c9cb1d5f3a857e441f4/FLAGc6717c364 [2024-10-13 06:16:21,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/630df75f5/a86de9ca07354c9cb1d5f3a857e441f4 [2024-10-13 06:16:21,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:16:21,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:16:21,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:16:21,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:16:21,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:16:21,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc3cccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21, skipping insertion in model container [2024-10-13 06:16:21,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:16:21,394 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2024-10-13 06:16:21,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:16:21,483 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:16:21,495 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2024-10-13 06:16:21,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:16:21,554 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:16:21,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21 WrapperNode [2024-10-13 06:16:21,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:16:21,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:16:21,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:16:21,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:16:21,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,626 INFO L138 Inliner]: procedures = 36, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-10-13 06:16:21,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:16:21,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:16:21,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:16:21,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:16:21,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,674 INFO L175 MemorySlicer]: Split 91 memory accesses to 10 slices as follows [2, 19, 6, 12, 12, 10, 8, 6, 8, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 2, 1, 1, 1, 1, 2, 1, 1]. [2024-10-13 06:16:21,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:16:21,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:16:21,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:16:21,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:16:21,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (1/1) ... [2024-10-13 06:16:21,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:16:21,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:16:21,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:16:21,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:16:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:16:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:16:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:16:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-13 06:16:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-13 06:16:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-13 06:16:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-13 06:16:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-13 06:16:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-13 06:16:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-13 06:16:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-13 06:16:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:16:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:16:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-13 06:16:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-13 06:16:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-13 06:16:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-13 06:16:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-13 06:16:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-13 06:16:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-13 06:16:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-13 06:16:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:16:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:16:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 06:16:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 06:16:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 06:16:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 06:16:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-13 06:16:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-13 06:16:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-13 06:16:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-13 06:16:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-13 06:16:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:16:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:16:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-13 06:16:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-13 06:16:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-13 06:16:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-13 06:16:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:16:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:16:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-13 06:16:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-13 06:16:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-13 06:16:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-13 06:16:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-13 06:16:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-13 06:16:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-13 06:16:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-13 06:16:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:16:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:16:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-13 06:16:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-13 06:16:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-13 06:16:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-13 06:16:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-13 06:16:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-13 06:16:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-13 06:16:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-13 06:16:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:16:21,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:16:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:16:21,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:16:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:16:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:16:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 06:16:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 06:16:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 06:16:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-13 06:16:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-13 06:16:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-13 06:16:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-13 06:16:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-13 06:16:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:16:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:16:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 06:16:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 06:16:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 06:16:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-13 06:16:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-13 06:16:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-13 06:16:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-13 06:16:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-13 06:16:22,088 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:16:22,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:16:31,911 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-13 06:16:31,912 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:16:31,964 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:16:31,964 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:16:31,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:16:31 BoogieIcfgContainer [2024-10-13 06:16:31,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:16:31,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:16:31,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:16:31,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:16:31,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:16:21" (1/3) ... [2024-10-13 06:16:31,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2a0665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:16:31, skipping insertion in model container [2024-10-13 06:16:31,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:16:21" (2/3) ... [2024-10-13 06:16:31,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2a0665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:16:31, skipping insertion in model container [2024-10-13 06:16:31,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:16:31" (3/3) ... [2024-10-13 06:16:31,975 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-21.i [2024-10-13 06:16:31,997 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:16:31,998 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:16:32,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:16:32,078 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;@4095e1e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:16:32,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:16:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 06:16:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 06:16:32,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:32,097 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:32,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:32,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1647384108, now seen corresponding path program 1 times [2024-10-13 06:16:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956158777] [2024-10-13 06:16:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:32,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:32,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:32,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:32,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 06:16:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:32,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:16:32,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-13 06:16:32,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:32,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956158777] [2024-10-13 06:16:32,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956158777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:32,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:16:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452233528] [2024-10-13 06:16:32,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:16:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:32,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:16:32,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:16:32,636 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:32,708 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2024-10-13 06:16:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:16:32,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2024-10-13 06:16:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:32,721 INFO L225 Difference]: With dead ends: 175 [2024-10-13 06:16:32,721 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 06:16:32,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:16:32,732 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:32,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:32,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 06:16:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 06:16:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 78 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 06:16:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-10-13 06:16:32,788 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 75 [2024-10-13 06:16:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:32,789 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-10-13 06:16:32,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-10-13 06:16:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 06:16:32,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:32,794 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:32,810 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-10-13 06:16:32,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:32,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:32,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1170950670, now seen corresponding path program 1 times [2024-10-13 06:16:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:32,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037820440] [2024-10-13 06:16:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:32,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:32,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:33,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:33,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 06:16:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:33,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:16:33,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:33,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:16:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:33,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:33,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037820440] [2024-10-13 06:16:33,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037820440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:33,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:33,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:16:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340425248] [2024-10-13 06:16:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:33,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:16:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:16:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:16:33,901 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:36,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:16:39,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:16:43,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:16:45,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:16:49,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:16:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:49,428 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2024-10-13 06:16:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:16:49,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2024-10-13 06:16:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:49,433 INFO L225 Difference]: With dead ends: 289 [2024-10-13 06:16:49,435 INFO L226 Difference]: Without dead ends: 203 [2024-10-13 06:16:49,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:49,438 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 217 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:49,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 352 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2024-10-13 06:16:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-13 06:16:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2024-10-13 06:16:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.4625) internal successors, (234), 160 states have internal predecessors, (234), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:16:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2024-10-13 06:16:49,479 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 75 [2024-10-13 06:16:49,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:49,479 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2024-10-13 06:16:49,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2024-10-13 06:16:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-13 06:16:49,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:49,485 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:49,503 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:49,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:49,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:49,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2088746051, now seen corresponding path program 1 times [2024-10-13 06:16:49,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:49,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506587664] [2024-10-13 06:16:49,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:49,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:49,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:49,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:49,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 06:16:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:50,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:16:50,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:50,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-13 06:16:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 06:16:51,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:16:51,913 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 06:16:51,914 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 30 treesize of output 25 [2024-10-13 06:16:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-13 06:16:52,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506587664] [2024-10-13 06:16:52,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506587664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:16:52,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:16:52,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-10-13 06:16:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192114382] [2024-10-13 06:16:52,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:16:52,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 06:16:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:52,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 06:16:52,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:16:52,137 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 19 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-13 06:16:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:53,476 INFO L93 Difference]: Finished difference Result 339 states and 491 transitions. [2024-10-13 06:16:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:16:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 19 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 78 [2024-10-13 06:16:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:53,481 INFO L225 Difference]: With dead ends: 339 [2024-10-13 06:16:53,484 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 06:16:53,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2024-10-13 06:16:53,486 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 508 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:53,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 945 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:16:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 06:16:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-13 06:16:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:16:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 228 transitions. [2024-10-13 06:16:53,513 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 228 transitions. Word has length 78 [2024-10-13 06:16:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:53,513 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 228 transitions. [2024-10-13 06:16:53,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 19 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-13 06:16:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 228 transitions. [2024-10-13 06:16:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 06:16:53,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:53,515 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:53,531 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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:53,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:53,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:53,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1279428245, now seen corresponding path program 1 times [2024-10-13 06:16:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647088986] [2024-10-13 06:16:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:53,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:53,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:53,724 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:53,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 06:16:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:54,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:16:54,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:54,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:54,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:54,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647088986] [2024-10-13 06:16:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647088986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:54,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:54,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:16:54,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861439311] [2024-10-13 06:16:54,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:54,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:16:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:16:54,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:54,226 INFO L87 Difference]: Start difference. First operand 163 states and 228 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:54,389 INFO L93 Difference]: Finished difference Result 260 states and 366 transitions. [2024-10-13 06:16:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:16:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2024-10-13 06:16:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:54,392 INFO L225 Difference]: With dead ends: 260 [2024-10-13 06:16:54,392 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 06:16:54,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:54,394 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:54,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:16:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 06:16:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-13 06:16:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.4) internal successors, (203), 145 states have internal predecessors, (203), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:16:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 231 transitions. [2024-10-13 06:16:54,410 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 231 transitions. Word has length 79 [2024-10-13 06:16:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:54,411 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 231 transitions. [2024-10-13 06:16:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 231 transitions. [2024-10-13 06:16:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 06:16:54,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:54,412 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:54,435 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 (5)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:54,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:54,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1458948386, now seen corresponding path program 1 times [2024-10-13 06:16:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896372509] [2024-10-13 06:16:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:54,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:54,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:54,618 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:54,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:16:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:55,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 06:16:55,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:56,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-13 06:16:56,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-10-13 06:16:56,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2024-10-13 06:16:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 06:16:56,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:16:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:16:56,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896372509] [2024-10-13 06:16:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896372509] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:16:56,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:16:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-10-13 06:16:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761967521] [2024-10-13 06:16:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:56,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:16:56,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:16:56,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:16:56,742 INFO L87 Difference]: Start difference. First operand 166 states and 231 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:57,064 INFO L93 Difference]: Finished difference Result 326 states and 455 transitions. [2024-10-13 06:16:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:16:57,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-10-13 06:16:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:57,067 INFO L225 Difference]: With dead ends: 326 [2024-10-13 06:16:57,067 INFO L226 Difference]: Without dead ends: 229 [2024-10-13 06:16:57,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:16:57,069 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 71 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:57,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 731 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:16:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-13 06:16:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-10-13 06:16:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.3980099502487562) internal successors, (281), 202 states have internal predecessors, (281), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:16:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 315 transitions. [2024-10-13 06:16:57,099 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 315 transitions. Word has length 83 [2024-10-13 06:16:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:57,099 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 315 transitions. [2024-10-13 06:16:57,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:16:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 315 transitions. [2024-10-13 06:16:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:16:57,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:57,105 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:57,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 06:16:57,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:57,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:57,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1192571191, now seen corresponding path program 1 times [2024-10-13 06:16:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:57,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953019321] [2024-10-13 06:16:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:57,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:57,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:57,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:57,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 06:16:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:57,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:16:57,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:58,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-13 06:16:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 06:16:58,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:16:59,368 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 06:16:59,368 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 30 treesize of output 25 [2024-10-13 06:16:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-13 06:16:59,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:59,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953019321] [2024-10-13 06:16:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953019321] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:16:59,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:16:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-10-13 06:16:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225553272] [2024-10-13 06:16:59,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:16:59,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 06:16:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 06:16:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:16:59,526 INFO L87 Difference]: Start difference. First operand 226 states and 315 transitions. Second operand has 21 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-13 06:17:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:00,765 INFO L93 Difference]: Finished difference Result 380 states and 533 transitions. [2024-10-13 06:17:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:17:00,767 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 85 [2024-10-13 06:17:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:00,770 INFO L225 Difference]: With dead ends: 380 [2024-10-13 06:17:00,770 INFO L226 Difference]: Without dead ends: 226 [2024-10-13 06:17:00,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2024-10-13 06:17:00,771 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 291 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:00,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 942 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:17:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-13 06:17:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-10-13 06:17:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 202 states have internal predecessors, (279), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:17:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 313 transitions. [2024-10-13 06:17:00,786 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 313 transitions. Word has length 85 [2024-10-13 06:17:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 313 transitions. [2024-10-13 06:17:00,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-13 06:17:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 313 transitions. [2024-10-13 06:17:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:17:00,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:00,789 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:17:00,808 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 06:17:00,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:00,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:00,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2083655284, now seen corresponding path program 1 times [2024-10-13 06:17:00,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:00,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913354518] [2024-10-13 06:17:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:00,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:00,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:00,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:17:00,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 06:17:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:01,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:17:01,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:01,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:17:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:17:01,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:01,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:01,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913354518] [2024-10-13 06:17:01,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913354518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:01,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:01,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:17:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698150364] [2024-10-13 06:17:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:01,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:01,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:01,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:01,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:01,605 INFO L87 Difference]: Start difference. First operand 226 states and 313 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:01,750 INFO L93 Difference]: Finished difference Result 517 states and 718 transitions. [2024-10-13 06:17:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:17:01,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-13 06:17:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:01,753 INFO L225 Difference]: With dead ends: 517 [2024-10-13 06:17:01,753 INFO L226 Difference]: Without dead ends: 359 [2024-10-13 06:17:01,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:17:01,754 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 193 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:01,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 559 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-13 06:17:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 322. [2024-10-13 06:17:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 287 states have (on average 1.3832752613240418) internal successors, (397), 288 states have internal predecessors, (397), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:17:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2024-10-13 06:17:01,784 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 85 [2024-10-13 06:17:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:01,785 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2024-10-13 06:17:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2024-10-13 06:17:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:17:01,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:01,787 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:17:01,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 06:17:01,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:01,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1190243658, now seen corresponding path program 1 times [2024-10-13 06:17:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287106866] [2024-10-13 06:17:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:01,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:01,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:01,993 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:17:01,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 06:17:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:02,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 06:17:02,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:07,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:07,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 102 [2024-10-13 06:17:07,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:07,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 63 [2024-10-13 06:17:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-13 06:17:07,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:17:09,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:09,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287106866] [2024-10-13 06:17:09,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287106866] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:09,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:09,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 22 [2024-10-13 06:17:09,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915105651] [2024-10-13 06:17:09,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:09,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:17:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:09,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:17:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-10-13 06:17:09,269 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:10,764 INFO L93 Difference]: Finished difference Result 654 states and 907 transitions. [2024-10-13 06:17:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:17:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-13 06:17:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:10,769 INFO L225 Difference]: With dead ends: 654 [2024-10-13 06:17:10,769 INFO L226 Difference]: Without dead ends: 404 [2024-10-13 06:17:10,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-10-13 06:17:10,772 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 113 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:10,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 633 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:17:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-13 06:17:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 366. [2024-10-13 06:17:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 331 states have (on average 1.3776435045317221) internal successors, (456), 332 states have internal predecessors, (456), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:17:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 504 transitions. [2024-10-13 06:17:10,800 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 504 transitions. Word has length 85 [2024-10-13 06:17:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:10,801 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 504 transitions. [2024-10-13 06:17:10,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 504 transitions. [2024-10-13 06:17:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:17:10,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:10,802 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:17:10,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 06:17:11,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:11,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:11,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1870302028, now seen corresponding path program 1 times [2024-10-13 06:17:11,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:11,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430417590] [2024-10-13 06:17:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:11,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:11,006 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:17:11,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 06:17:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:11,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 06:17:11,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:15,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:15,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 87 [2024-10-13 06:17:15,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:15,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 63 [2024-10-13 06:17:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 06:17:15,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:17:16,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:16,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430417590] [2024-10-13 06:17:16,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430417590] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:16,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:16,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-10-13 06:17:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580840099] [2024-10-13 06:17:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:16,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:17:16,393 INFO L87 Difference]: Start difference. First operand 366 states and 504 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:16,967 INFO L93 Difference]: Finished difference Result 723 states and 998 transitions. [2024-10-13 06:17:16,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:16,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-13 06:17:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:16,972 INFO L225 Difference]: With dead ends: 723 [2024-10-13 06:17:16,972 INFO L226 Difference]: Without dead ends: 436 [2024-10-13 06:17:16,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:17:16,974 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:16,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 352 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:17:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-13 06:17:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 381. [2024-10-13 06:17:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 346 states have (on average 1.3670520231213872) internal successors, (473), 347 states have internal predecessors, (473), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:17:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 521 transitions. [2024-10-13 06:17:17,001 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 521 transitions. Word has length 85 [2024-10-13 06:17:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:17,002 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 521 transitions. [2024-10-13 06:17:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 521 transitions. [2024-10-13 06:17:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:17:17,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:17,005 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:17:17,024 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-10-13 06:17:17,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:17,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:17,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash 372595208, now seen corresponding path program 1 times [2024-10-13 06:17:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:17,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401900369] [2024-10-13 06:17:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:17,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:17,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:17,208 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:17:17,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 06:17:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:17,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 06:17:17,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:20,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:20,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 88 [2024-10-13 06:17:20,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:20,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 64 [2024-10-13 06:17:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 06:17:20,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:17:21,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:21,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401900369] [2024-10-13 06:17:21,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401900369] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:21,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-13 06:17:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822871643] [2024-10-13 06:17:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:21,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:21,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:17:21,398 INFO L87 Difference]: Start difference. First operand 381 states and 521 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:22,157 INFO L93 Difference]: Finished difference Result 735 states and 1009 transitions. [2024-10-13 06:17:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:17:22,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-13 06:17:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:22,162 INFO L225 Difference]: With dead ends: 735 [2024-10-13 06:17:22,162 INFO L226 Difference]: Without dead ends: 436 [2024-10-13 06:17:22,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:17:22,167 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 72 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:22,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 416 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:17:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-13 06:17:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 381. [2024-10-13 06:17:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 346 states have (on average 1.3583815028901733) internal successors, (470), 347 states have internal predecessors, (470), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:17:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 518 transitions. [2024-10-13 06:17:22,190 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 518 transitions. Word has length 85 [2024-10-13 06:17:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:22,190 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 518 transitions. [2024-10-13 06:17:22,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 518 transitions. [2024-10-13 06:17:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 06:17:22,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:22,192 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:17:22,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 06:17:22,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:22,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:22,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1052653578, now seen corresponding path program 1 times [2024-10-13 06:17:22,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:22,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915751656] [2024-10-13 06:17:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:22,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:22,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:22,398 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:17:22,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 06:17:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:22,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 06:17:22,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:26,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:26,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 87 [2024-10-13 06:17:26,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:17:26,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 63 [2024-10-13 06:17:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:17:27,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:17:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:17:28,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:28,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915751656] [2024-10-13 06:17:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915751656] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:17:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:17:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2024-10-13 06:17:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382287735] [2024-10-13 06:17:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:28,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:17:28,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:17:28,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:17:28,682 INFO L87 Difference]: Start difference. First operand 381 states and 518 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:30,309 INFO L93 Difference]: Finished difference Result 740 states and 1006 transitions. [2024-10-13 06:17:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:17:30,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-13 06:17:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:30,315 INFO L225 Difference]: With dead ends: 740 [2024-10-13 06:17:30,315 INFO L226 Difference]: Without dead ends: 441 [2024-10-13 06:17:30,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:17:30,317 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 49 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:30,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 767 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:17:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-13 06:17:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 437. [2024-10-13 06:17:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 397 states have (on average 1.3526448362720402) internal successors, (537), 400 states have internal predecessors, (537), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:17:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 589 transitions. [2024-10-13 06:17:30,342 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 589 transitions. Word has length 85 [2024-10-13 06:17:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:30,343 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 589 transitions. [2024-10-13 06:17:30,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 589 transitions. [2024-10-13 06:17:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 06:17:30,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:30,345 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:17:30,364 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-10-13 06:17:30,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:30,546 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -581855366, now seen corresponding path program 1 times [2024-10-13 06:17:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179488932] [2024-10-13 06:17:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:30,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:30,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:30,548 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:17:30,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 06:17:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:17:30,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:17:30,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:17:31,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:17:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:17:31,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:17:31,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:17:31,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179488932] [2024-10-13 06:17:31,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179488932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:17:31,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:17:31,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:17:31,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475910168] [2024-10-13 06:17:31,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:17:31,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:17:31,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:17:31,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:17:31,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:17:31,145 INFO L87 Difference]: Start difference. First operand 437 states and 589 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:17:31,322 INFO L93 Difference]: Finished difference Result 840 states and 1137 transitions. [2024-10-13 06:17:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:17:31,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 86 [2024-10-13 06:17:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:17:31,325 INFO L225 Difference]: With dead ends: 840 [2024-10-13 06:17:31,325 INFO L226 Difference]: Without dead ends: 489 [2024-10-13 06:17:31,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:17:31,327 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 174 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:17:31,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 563 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:17:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-13 06:17:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 467. [2024-10-13 06:17:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 427 states have (on average 1.3395784543325526) internal successors, (572), 430 states have internal predecessors, (572), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:17:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 624 transitions. [2024-10-13 06:17:31,359 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 624 transitions. Word has length 86 [2024-10-13 06:17:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:17:31,359 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 624 transitions. [2024-10-13 06:17:31,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-13 06:17:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 624 transitions. [2024-10-13 06:17:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 06:17:31,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:17:31,361 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:17:31,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 06:17:31,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:31,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:17:31,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:17:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash -711143622, now seen corresponding path program 1 times [2024-10-13 06:17:31,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:17:31,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914585612] [2024-10-13 06:17:31,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:17:31,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:17:31,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:17:31,564 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:17:31,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process