./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-a_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:13:07,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:13:07,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:13:07,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:13:07,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:13:07,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:13:07,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:13:07,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:13:07,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:13:07,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:13:07,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:13:07,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:13:07,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:13:07,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:13:07,669 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:13:07,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:13:07,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:13:07,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:13:07,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:13:07,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:13:07,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:13:07,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:13:07,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:13:07,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:13:07,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:13:07,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:13:07,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:13:07,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:13:07,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:13:07,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:13:07,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:13:07,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:13:07,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:13:07,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:13:07,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:13:07,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:13:07,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:13:07,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:13:07,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:13:07,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:13:07,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:13:07,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:13:07,681 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-clean/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-clean/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 -> e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 [2024-10-11 13:13:07,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:13:07,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:13:07,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:13:07,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:13:07,994 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:13:07,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-10-11 13:13:09,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:13:09,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:13:09,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-10-11 13:13:09,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/834914220/6878843668ae4781903034ede9b318ab/FLAG06229a638 [2024-10-11 13:13:09,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/834914220/6878843668ae4781903034ede9b318ab [2024-10-11 13:13:09,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:13:09,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:13:09,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:13:09,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:13:09,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:13:09,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa9ca7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09, skipping insertion in model container [2024-10-11 13:13:09,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:13:09,922 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-a_file-1.i[915,928] [2024-10-11 13:13:09,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:13:10,011 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:13:10,021 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-a_file-1.i[915,928] [2024-10-11 13:13:10,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:13:10,077 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:13:10,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10 WrapperNode [2024-10-11 13:13:10,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:13:10,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:13:10,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:13:10,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:13:10,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,145 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2024-10-11 13:13:10,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:13:10,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:13:10,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:13:10,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:13:10,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,208 INFO L175 MemorySlicer]: Split 127 memory accesses to 7 slices as follows [2, 14, 39, 34, 21, 11, 6]. 31 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 2, 4, 4, 1, 1, 1]. The 17 writes are split as follows [0, 2, 6, 5, 1, 1, 2]. [2024-10-11 13:13:10,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:13:10,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:13:10,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:13:10,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:13:10,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (1/1) ... [2024-10-11 13:13:10,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:13:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:13:10,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:13:10,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:13:10,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:13:10,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:13:10,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:13:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:13:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:13:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:13:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:13:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:13:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:13:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:13:10,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:13:10,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:13:10,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:13:10,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:13:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:13:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:13:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:13:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:13:10,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:13:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:13:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:13:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:13:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:13:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:13:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:13:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:13:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:13:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:13:10,598 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:13:10,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:13:11,094 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-11 13:13:11,094 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:13:11,132 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:13:11,132 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:13:11,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:11 BoogieIcfgContainer [2024-10-11 13:13:11,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:13:11,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:13:11,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:13:11,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:13:11,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:13:09" (1/3) ... [2024-10-11 13:13:11,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3b4116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:13:11, skipping insertion in model container [2024-10-11 13:13:11,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:10" (2/3) ... [2024-10-11 13:13:11,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3b4116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:13:11, skipping insertion in model container [2024-10-11 13:13:11,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:11" (3/3) ... [2024-10-11 13:13:11,142 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-1.i [2024-10-11 13:13:11,158 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:13:11,158 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:13:11,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:13:11,227 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;@4cd0de38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:13:11,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:13:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:13:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:11,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:11,244 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:11,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:11,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:11,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1795908360, now seen corresponding path program 1 times [2024-10-11 13:13:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:11,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010538470] [2024-10-11 13:13:11,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:13:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:13:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:13:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:13:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:13:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:13:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:13:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:13:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:13:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:13:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:13:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:13:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:13:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:13:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:11,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:13:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010538470] [2024-10-11 13:13:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010538470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:11,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:11,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:13:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802020965] [2024-10-11 13:13:11,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:11,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:13:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:13:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:13:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:13:11,709 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:11,789 INFO L93 Difference]: Finished difference Result 199 states and 314 transitions. [2024-10-11 13:13:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:13:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-10-11 13:13:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:11,800 INFO L225 Difference]: With dead ends: 199 [2024-10-11 13:13:11,801 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 13:13:11,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-11 13:13:11,810 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:11,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:13:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 13:13:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 13:13:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:13:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2024-10-11 13:13:11,853 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 119 [2024-10-11 13:13:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:11,854 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2024-10-11 13:13:11,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2024-10-11 13:13:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:11,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:11,860 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:11,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:13:11,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:11,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash -463194576, now seen corresponding path program 1 times [2024-10-11 13:13:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302834977] [2024-10-11 13:13:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:13:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:13:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:13:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:13:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:13:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:13:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:13:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:13:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:13:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:13:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:13:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:13:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:13:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:13:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:13:12,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302834977] [2024-10-11 13:13:12,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302834977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:12,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:12,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:13:12,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700227739] [2024-10-11 13:13:12,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:12,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:13:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:13:12,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:13:12,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:12,198 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:12,261 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2024-10-11 13:13:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:13:12,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-10-11 13:13:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:12,264 INFO L225 Difference]: With dead ends: 199 [2024-10-11 13:13:12,264 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 13:13:12,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:12,266 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:12,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:13:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 13:13:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 13:13:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:13:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-10-11 13:13:12,279 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 119 [2024-10-11 13:13:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:12,281 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-10-11 13:13:12,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-10-11 13:13:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:12,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:12,283 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:13:12,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:12,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2097668270, now seen corresponding path program 1 times [2024-10-11 13:13:12,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:12,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410182824] [2024-10-11 13:13:12,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:13:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:13:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:13:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:13:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:13:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:13:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:13:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:13:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:13:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:13:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:13:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:13:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:13:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:13:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:12,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:13:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410182824] [2024-10-11 13:13:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410182824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:12,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:13:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932184409] [2024-10-11 13:13:12,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:12,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:13:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:13:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:13:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:12,562 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:12,615 INFO L93 Difference]: Finished difference Result 204 states and 299 transitions. [2024-10-11 13:13:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:13:12,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-11 13:13:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:12,626 INFO L225 Difference]: With dead ends: 204 [2024-10-11 13:13:12,626 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 13:13:12,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:12,628 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:12,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 409 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:13:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 13:13:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-11 13:13:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:13:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-10-11 13:13:12,641 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 119 [2024-10-11 13:13:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:12,642 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-10-11 13:13:12,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-10-11 13:13:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:12,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:12,644 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:13:12,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:12,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2140040724, now seen corresponding path program 1 times [2024-10-11 13:13:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403516561] [2024-10-11 13:13:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:13:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:13:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:13:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:13:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:13:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:13:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:13:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:13:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:13:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:13:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:13:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:13:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:13:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:13:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:12,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:13:12,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403516561] [2024-10-11 13:13:12,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403516561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:12,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:12,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:13:12,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658415979] [2024-10-11 13:13:12,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:12,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:13:12,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:13:12,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:13:12,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:12,863 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:12,933 INFO L93 Difference]: Finished difference Result 208 states and 303 transitions. [2024-10-11 13:13:12,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:13:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-11 13:13:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:12,935 INFO L225 Difference]: With dead ends: 208 [2024-10-11 13:13:12,935 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 13:13:12,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:12,937 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:12,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 413 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 13:13:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-11 13:13:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:13:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2024-10-11 13:13:12,957 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 119 [2024-10-11 13:13:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:12,957 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2024-10-11 13:13:12,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2024-10-11 13:13:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:12,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:12,963 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:12,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:13:12,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:12,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:12,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2139981142, now seen corresponding path program 1 times [2024-10-11 13:13:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:12,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989634243] [2024-10-11 13:13:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:12,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:13:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:13:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:13:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:13:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:13:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:13:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:13:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:13:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:13:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:13:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:13:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:13:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:13:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:13:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:13:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989634243] [2024-10-11 13:13:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989634243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:13,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:13,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:13:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319883095] [2024-10-11 13:13:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:13,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:13:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:13:13,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:13:13,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:13:13,617 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:13,774 INFO L93 Difference]: Finished difference Result 268 states and 385 transitions. [2024-10-11 13:13:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:13:13,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-10-11 13:13:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:13,780 INFO L225 Difference]: With dead ends: 268 [2024-10-11 13:13:13,780 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 13:13:13,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:13:13,782 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 75 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:13,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 873 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 13:13:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2024-10-11 13:13:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 142 states have (on average 1.4014084507042253) internal successors, (199), 143 states have internal predecessors, (199), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:13:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 231 transitions. [2024-10-11 13:13:13,808 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 231 transitions. Word has length 119 [2024-10-11 13:13:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:13,809 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 231 transitions. [2024-10-11 13:13:13,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 231 transitions. [2024-10-11 13:13:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:13,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:13,814 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:13,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:13:13,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:13,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash 349547820, now seen corresponding path program 1 times [2024-10-11 13:13:13,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:13,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492306740] [2024-10-11 13:13:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:13:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:13:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:13:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:13:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:13:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:13:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:13:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:13:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:13:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:13:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:13:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:13:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:13:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:13:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:14,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:13:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492306740] [2024-10-11 13:13:14,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492306740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:14,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:13:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143724498] [2024-10-11 13:13:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:14,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:13:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:13:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:13:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:13:14,293 INFO L87 Difference]: Start difference. First operand 161 states and 231 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:14,436 INFO L93 Difference]: Finished difference Result 380 states and 543 transitions. [2024-10-11 13:13:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:13:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-10-11 13:13:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:14,440 INFO L225 Difference]: With dead ends: 380 [2024-10-11 13:13:14,441 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 13:13:14,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:13:14,443 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 67 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:14,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 683 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 13:13:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2024-10-11 13:13:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.414012738853503) internal successors, (222), 158 states have internal predecessors, (222), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:13:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 254 transitions. [2024-10-11 13:13:14,468 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 254 transitions. Word has length 119 [2024-10-11 13:13:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:14,469 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 254 transitions. [2024-10-11 13:13:14,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2024-10-11 13:13:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:14,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:14,472 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:14,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:13:14,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:14,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash -237258194, now seen corresponding path program 1 times [2024-10-11 13:13:14,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:14,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103956894] [2024-10-11 13:13:14,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:14,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:13:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:13:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:13:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:13:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:13:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:13:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:13:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:13:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:13:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:13:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:13:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:13:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:13:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:13:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:13:15,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:13:15,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103956894] [2024-10-11 13:13:15,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103956894] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:15,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114074579] [2024-10-11 13:13:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:15,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:13:15,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:13:15,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:13:15,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:13:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:15,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:13:15,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:15,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 13:13:15,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:15,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 13:13:15,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:15,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 14 [2024-10-11 13:13:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 195 proven. 18 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-11 13:13:15,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:13:15,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114074579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:13:15,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:13:15,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-10-11 13:13:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461537974] [2024-10-11 13:13:15,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:13:15,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:13:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:13:15,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:13:15,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:13:15,790 INFO L87 Difference]: Start difference. First operand 176 states and 254 transitions. Second operand has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-11 13:13:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:16,274 INFO L93 Difference]: Finished difference Result 497 states and 708 transitions. [2024-10-11 13:13:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:13:16,275 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 5 states have call successors, (22) Word has length 119 [2024-10-11 13:13:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:16,278 INFO L225 Difference]: With dead ends: 497 [2024-10-11 13:13:16,278 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 13:13:16,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:13:16,280 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 574 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:16,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 856 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:13:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 13:13:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 311. [2024-10-11 13:13:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 280 states have (on average 1.3928571428571428) internal successors, (390), 283 states have internal predecessors, (390), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:13:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 440 transitions. [2024-10-11 13:13:16,311 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 440 transitions. Word has length 119 [2024-10-11 13:13:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:16,312 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 440 transitions. [2024-10-11 13:13:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-11 13:13:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 440 transitions. [2024-10-11 13:13:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:16,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:16,314 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:16,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:13:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:13:16,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:16,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1825606096, now seen corresponding path program 1 times [2024-10-11 13:13:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:16,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596023385] [2024-10-11 13:13:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:13:16,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:13:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:13:16,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:13:16,715 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:13:16,716 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:13:16,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:13:16,721 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:13:16,847 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:13:16,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:13:16 BoogieIcfgContainer [2024-10-11 13:13:16,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:13:16,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:13:16,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:13:16,851 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:13:16,852 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:11" (3/4) ... [2024-10-11 13:13:16,854 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:13:16,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:13:16,856 INFO L158 Benchmark]: Toolchain (without parser) took 7148.17ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 85.8MB in the beginning and 201.6MB in the end (delta: -115.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:13:16,856 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:13:16,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.02ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 69.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:13:16,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.11ms. Allocated memory is still 155.2MB. Free memory was 69.0MB in the beginning and 65.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:13:16,857 INFO L158 Benchmark]: Boogie Preprocessor took 188.19ms. Allocated memory is still 155.2MB. Free memory was 65.2MB in the beginning and 124.4MB in the end (delta: -59.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-10-11 13:13:16,857 INFO L158 Benchmark]: RCFGBuilder took 797.33ms. Allocated memory is still 155.2MB. Free memory was 124.2MB in the beginning and 84.8MB in the end (delta: 39.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 13:13:16,858 INFO L158 Benchmark]: TraceAbstraction took 5715.00ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 84.3MB in the beginning and 201.6MB in the end (delta: -117.3MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2024-10-11 13:13:16,858 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 245.4MB. Free memory is still 201.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:13:16,860 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.15ms. Allocated memory is still 117.4MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.02ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 69.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.11ms. Allocated memory is still 155.2MB. Free memory was 69.0MB in the beginning and 65.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 188.19ms. Allocated memory is still 155.2MB. Free memory was 65.2MB in the beginning and 124.4MB in the end (delta: -59.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * RCFGBuilder took 797.33ms. Allocated memory is still 155.2MB. Free memory was 124.2MB in the beginning and 84.8MB in the end (delta: 39.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5715.00ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 84.3MB in the beginning and 201.6MB in the end (delta: -117.3MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 245.4MB. Free memory is still 201.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 50 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 50 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 16 }; [L40] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 16; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] EXPR unsigned_long_int_Array_0[0] [L99] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] float_Array_0[0][0] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[0][0] [L82] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L82] EXPR float_Array_0[0][0] [L82] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] float_Array_0[1][0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[1][0] [L84] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L84] EXPR float_Array_0[1][0] [L84] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] float_Array_0[0][1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[0][1] [L86] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L86] EXPR float_Array_0[0][1] [L86] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L88] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] signed_long_int_Array_0[1][0] = __VERIFIER_nondet_long() [L91] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_long_int_Array_0[1][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L110] RET updateVariables() [L111] CALL step() [L44] EXPR float_Array_0[0][1] [L44] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L44] COND FALSE !(float_Array_0[0][1] <= (- float_Array_0[1][0])) [L47] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L50] EXPR float_Array_0[0][0] [L50] float_Array_0[1][1] = float_Array_0[0][0] [L53] EXPR unsigned_char_Array_0[0] [L53] signed_short_int_Array_0[0] = unsigned_char_Array_0[0] [L54] EXPR BOOL_unsigned_char_Array_0[0] [L54] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L55] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] COND FALSE !(BOOL_unsigned_char_Array_0[1] || stepLocal_0) [L58] EXPR signed_long_int_Array_0[0][0] [L58] EXPR signed_long_int_Array_0[1][0] [L58] signed_long_int_Array_0[1][1] = ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4) [L60] EXPR signed_long_int_Array_0[1][0] [L60] signed long int stepLocal_3 = signed_long_int_Array_0[1][0]; [L61] EXPR signed_short_int_Array_0[0] [L61] EXPR signed_long_int_Array_0[1][0] [L61] signed long int stepLocal_2 = signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]; [L62] EXPR signed_long_int_Array_0[1][0] [L62] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L62] EXPR signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=1, stepLocal_3=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L62] signed long int stepLocal_1 = signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]; [L63] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] EXPR ((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0]) [L63] EXPR signed_long_int_Array_0[0][0] [L63] EXPR ((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=0, stepLocal_2=1, stepLocal_3=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] COND FALSE !(stepLocal_1 != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) [L72] EXPR signed_short_int_Array_0[0] [L72] signed_long_int_Array_0[0][1] = signed_short_int_Array_0[0] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR float_Array_0[0][1] [L102] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0]))) [L102] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])) [L102] EXPR float_Array_0[1][1] [L102] EXPR float_Array_0[0][0] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102-L103] return (((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) unsigned_char_Array_0[0])) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 3785 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2748 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 703 IncrementalHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 1037 mSDtfsCounter, 703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 455 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 60 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1071 NumberOfCodeBlocks, 1071 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1062 ConstructedInterpolants, 0 QuantifiedInterpolants, 2009 SizeOfPredicates, 4 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3222/3276 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-11 13:13:16,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:13:19,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:13:19,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:13:19,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:13:19,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:13:19,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:13:19,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:13:19,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:13:19,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:13:19,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:13:19,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:13:19,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:13:19,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:13:19,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:13:19,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:13:19,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:13:19,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:13:19,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:13:19,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:13:19,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:13:19,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:13:19,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:13:19,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:13:19,312 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:13:19,312 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:13:19,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:13:19,312 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:13:19,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:13:19,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:13:19,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:13:19,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:13:19,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:13:19,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:13:19,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:13:19,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:13:19,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:13:19,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:13:19,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:13:19,318 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:13:19,318 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:13:19,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:13:19,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:13:19,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:13:19,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:13:19,321 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:13:19,321 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-clean/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-clean/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 -> e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 [2024-10-11 13:13:19,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:13:19,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:13:19,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:13:19,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:13:19,671 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:13:19,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-10-11 13:13:21,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:13:21,373 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:13:21,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-10-11 13:13:21,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/24fb944d0/6ca1cf6de8974053a40b51de13805d63/FLAG48cc553d0 [2024-10-11 13:13:21,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/24fb944d0/6ca1cf6de8974053a40b51de13805d63 [2024-10-11 13:13:21,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:13:21,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:13:21,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:13:21,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:13:21,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:13:21,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:21,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6cbe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21, skipping insertion in model container [2024-10-11 13:13:21,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:21,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:13:21,636 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-a_file-1.i[915,928] [2024-10-11 13:13:21,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:13:21,738 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:13:21,764 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-a_file-1.i[915,928] [2024-10-11 13:13:21,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:13:21,854 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:13:21,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21 WrapperNode [2024-10-11 13:13:21,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:13:21,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:13:21,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:13:21,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:13:21,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:21,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:21,943 INFO L138 Inliner]: procedures = 36, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-10-11 13:13:21,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:13:21,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:13:21,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:13:21,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:13:21,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:21,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:21,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:21,987 INFO L175 MemorySlicer]: Split 127 memory accesses to 7 slices as follows [2, 14, 39, 34, 21, 11, 6]. 31 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 2, 4, 4, 1, 1, 1]. The 17 writes are split as follows [0, 2, 6, 5, 1, 1, 2]. [2024-10-11 13:13:21,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:21,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:22,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:22,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:22,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:22,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:22,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:13:22,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:13:22,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:13:22,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:13:22,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (1/1) ... [2024-10-11 13:13:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:13:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:13:22,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:13:22,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:13:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:13:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:13:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:13:22,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:13:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:13:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:13:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:13:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:13:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:13:22,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:13:22,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:13:22,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:13:22,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:13:22,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:13:22,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:13:22,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:13:22,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:13:22,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:13:22,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:13:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:13:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:13:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:13:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:13:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:13:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:13:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:13:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:13:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:13:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:13:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:13:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:13:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:13:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:13:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:13:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:13:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:13:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:13:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:13:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:13:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:13:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:13:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:13:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:13:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:13:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:13:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:13:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:13:22,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:13:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:13:22,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:13:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:13:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:13:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:13:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:13:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:13:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:13:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:13:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:13:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:13:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:13:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:13:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:13:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:13:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:13:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:13:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:13:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:13:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:13:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:13:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:13:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:13:22,361 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:13:22,363 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:13:23,075 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-11 13:13:23,075 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:13:23,118 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:13:23,119 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:13:23,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:23 BoogieIcfgContainer [2024-10-11 13:13:23,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:13:23,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:13:23,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:13:23,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:13:23,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:13:21" (1/3) ... [2024-10-11 13:13:23,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459e2683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:13:23, skipping insertion in model container [2024-10-11 13:13:23,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:21" (2/3) ... [2024-10-11 13:13:23,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459e2683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:13:23, skipping insertion in model container [2024-10-11 13:13:23,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:23" (3/3) ... [2024-10-11 13:13:23,127 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-1.i [2024-10-11 13:13:23,144 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:13:23,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:13:23,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:13:23,219 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;@c0cbc45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:13:23,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:13:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:13:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:13:23,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:23,239 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:23,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:23,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash -160734490, now seen corresponding path program 1 times [2024-10-11 13:13:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:23,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593455531] [2024-10-11 13:13:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:23,261 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-11 13:13:23,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:23,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:23,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:23,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:13:23,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-10-11 13:13:23,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:23,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593455531] [2024-10-11 13:13:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593455531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:13:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89435149] [2024-10-11 13:13:23,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:23,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:13:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:13:23,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:13:23,706 INFO L87 Difference]: Start difference. First operand has 95 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:23,779 INFO L93 Difference]: Finished difference Result 187 states and 298 transitions. [2024-10-11 13:13:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:13:23,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-10-11 13:13:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:23,798 INFO L225 Difference]: With dead ends: 187 [2024-10-11 13:13:23,802 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:13:23,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-11 13:13:23,815 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:23,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:13:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:13:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:13:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:13:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-10-11 13:13:23,862 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 117 [2024-10-11 13:13:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:23,863 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-10-11 13:13:23,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-10-11 13:13:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:13:23,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:23,868 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:23,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:24,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:24,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 283109918, now seen corresponding path program 1 times [2024-10-11 13:13:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223731230] [2024-10-11 13:13:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:24,071 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-11 13:13:24,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:24,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:24,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:24,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:13:24,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:13:24,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:24,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223731230] [2024-10-11 13:13:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223731230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:24,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:13:24,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646491739] [2024-10-11 13:13:24,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:24,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:13:24,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:13:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:24,468 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:24,553 INFO L93 Difference]: Finished difference Result 187 states and 278 transitions. [2024-10-11 13:13:24,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:13:24,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-10-11 13:13:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:24,556 INFO L225 Difference]: With dead ends: 187 [2024-10-11 13:13:24,557 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 13:13:24,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:24,559 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:24,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 13:13:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 13:13:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:13:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2024-10-11 13:13:24,571 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 117 [2024-10-11 13:13:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:24,573 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2024-10-11 13:13:24,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2024-10-11 13:13:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:13:24,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:24,575 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:24,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:24,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:24,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:24,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2100814820, now seen corresponding path program 1 times [2024-10-11 13:13:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511580296] [2024-10-11 13:13:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:24,785 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-11 13:13:24,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:24,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:24,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:25,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:13:25,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:25,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-11 13:13:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-11 13:13:25,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:25,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511580296] [2024-10-11 13:13:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511580296] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:25,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:13:25,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 13:13:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720169052] [2024-10-11 13:13:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:25,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:13:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:25,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:13:25,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:13:25,678 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:25,840 INFO L93 Difference]: Finished difference Result 238 states and 349 transitions. [2024-10-11 13:13:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:13:25,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-11 13:13:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:25,844 INFO L225 Difference]: With dead ends: 238 [2024-10-11 13:13:25,844 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 13:13:25,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:13:25,846 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 130 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:25,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 474 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 13:13:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-10-11 13:13:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:13:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-10-11 13:13:25,862 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 117 [2024-10-11 13:13:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:25,862 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-10-11 13:13:25,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-10-11 13:13:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:13:25,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:25,865 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:25,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:26,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:26,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1678112994, now seen corresponding path program 1 times [2024-10-11 13:13:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087751732] [2024-10-11 13:13:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:26,068 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-11 13:13:26,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:26,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:26,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:26,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:13:26,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:26,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:26,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087751732] [2024-10-11 13:13:26,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087751732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:26,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:26,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:13:26,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998108523] [2024-10-11 13:13:26,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:26,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:13:26,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:26,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:13:26,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:13:26,384 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:26,453 INFO L93 Difference]: Finished difference Result 291 states and 427 transitions. [2024-10-11 13:13:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:13:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-11 13:13:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:26,456 INFO L225 Difference]: With dead ends: 291 [2024-10-11 13:13:26,456 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 13:13:26,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-11 13:13:26,458 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:26,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 13:13:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2024-10-11 13:13:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 131 states have internal predecessors, (183), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:13:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 215 transitions. [2024-10-11 13:13:26,470 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 215 transitions. Word has length 117 [2024-10-11 13:13:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:26,471 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 215 transitions. [2024-10-11 13:13:26,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 215 transitions. [2024-10-11 13:13:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:13:26,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:26,473 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:26,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:13:26,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:26,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:26,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1620854692, now seen corresponding path program 1 times [2024-10-11 13:13:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:26,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390496468] [2024-10-11 13:13:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:26,675 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-11 13:13:26,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:26,679 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:26,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:26,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:13:26,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:26,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:26,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390496468] [2024-10-11 13:13:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390496468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:26,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:26,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:13:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572926026] [2024-10-11 13:13:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:26,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:13:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:26,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:13:26,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:13:26,963 INFO L87 Difference]: Start difference. First operand 149 states and 215 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:27,050 INFO L93 Difference]: Finished difference Result 303 states and 437 transitions. [2024-10-11 13:13:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:13:27,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-11 13:13:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:27,054 INFO L225 Difference]: With dead ends: 303 [2024-10-11 13:13:27,055 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 13:13:27,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:13:27,057 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:27,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 627 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 13:13:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2024-10-11 13:13:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.3955223880597014) internal successors, (187), 135 states have internal predecessors, (187), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:13:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2024-10-11 13:13:27,075 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 117 [2024-10-11 13:13:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:27,076 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2024-10-11 13:13:27,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2024-10-11 13:13:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:13:27,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:27,082 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:27,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:13:27,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:27,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:27,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1620795110, now seen corresponding path program 1 times [2024-10-11 13:13:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370850768] [2024-10-11 13:13:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:27,285 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-11 13:13:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:27,288 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:27,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:27,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:13:27,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:27,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:13:27,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 13:13:27,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:27,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 13:13:27,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:27,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 14 [2024-10-11 13:13:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 195 proven. 18 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-11 13:13:27,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:13:28,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:28,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370850768] [2024-10-11 13:13:28,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370850768] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:13:28,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:13:28,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-10-11 13:13:28,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115897639] [2024-10-11 13:13:28,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:13:28,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:13:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:28,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:13:28,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:13:28,026 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-11 13:13:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:28,908 INFO L93 Difference]: Finished difference Result 393 states and 557 transitions. [2024-10-11 13:13:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:13:28,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 117 [2024-10-11 13:13:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:28,911 INFO L225 Difference]: With dead ends: 393 [2024-10-11 13:13:28,911 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 13:13:28,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:13:28,916 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 532 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:28,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 699 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:13:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 13:13:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 232. [2024-10-11 13:13:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 206 states have internal predecessors, (282), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:13:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 328 transitions. [2024-10-11 13:13:28,950 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 328 transitions. Word has length 117 [2024-10-11 13:13:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:28,950 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 328 transitions. [2024-10-11 13:13:28,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-11 13:13:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 328 transitions. [2024-10-11 13:13:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:13:28,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:28,955 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:28,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 13:13:29,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:29,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:29,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1085824284, now seen corresponding path program 1 times [2024-10-11 13:13:29,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:29,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053784502] [2024-10-11 13:13:29,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:29,158 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-11 13:13:29,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:29,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:29,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:29,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:13:29,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:29,539 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 8 treesize of output 1 [2024-10-11 13:13:29,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:13:30,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:30,942 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 175 treesize of output 67 [2024-10-11 13:13:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 192 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 13:13:31,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:31,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:31,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053784502] [2024-10-11 13:13:31,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053784502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:31,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712766730] [2024-10-11 13:13:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:31,673 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:13:31,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:13:31,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:13:31,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-11 13:13:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:32,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 13:13:32,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:32,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:13:33,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-11 13:13:34,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:34,808 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 139 treesize of output 67 [2024-10-11 13:13:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 192 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 13:13:34,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1712766730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:35,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:13:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-11 13:13:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559893207] [2024-10-11 13:13:35,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:13:35,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 13:13:35,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 13:13:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:13:35,280 INFO L87 Difference]: Start difference. First operand 232 states and 328 transitions. Second operand has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:13:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:37,408 INFO L93 Difference]: Finished difference Result 838 states and 1183 transitions. [2024-10-11 13:13:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:13:37,410 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 117 [2024-10-11 13:13:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:37,413 INFO L225 Difference]: With dead ends: 838 [2024-10-11 13:13:37,414 INFO L226 Difference]: Without dead ends: 607 [2024-10-11 13:13:37,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 354 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 13:13:37,417 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 890 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:37,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1272 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 13:13:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-11 13:13:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 599. [2024-10-11 13:13:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 522 states have (on average 1.3773946360153257) internal successors, (719), 531 states have internal predecessors, (719), 65 states have call successors, (65), 11 states have call predecessors, (65), 11 states have return successors, (65), 56 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 13:13:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 849 transitions. [2024-10-11 13:13:37,469 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 849 transitions. Word has length 117 [2024-10-11 13:13:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:37,469 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 849 transitions. [2024-10-11 13:13:37,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:13:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 849 transitions. [2024-10-11 13:13:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:13:37,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:37,472 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:37,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 13:13:37,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:13:37,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:13:37,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1642385062, now seen corresponding path program 1 times [2024-10-11 13:13:37,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:37,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191374449] [2024-10-11 13:13:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:37,875 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-11 13:13:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:37,876 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:37,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:38,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:13:38,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:13:38,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:38,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:38,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191374449] [2024-10-11 13:13:38,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191374449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:38,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:38,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:13:38,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832333715] [2024-10-11 13:13:38,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:38,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:13:38,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:38,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:13:38,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:38,124 INFO L87 Difference]: Start difference. First operand 599 states and 849 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:38,213 INFO L93 Difference]: Finished difference Result 1197 states and 1697 transitions. [2024-10-11 13:13:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:13:38,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-10-11 13:13:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:38,220 INFO L225 Difference]: With dead ends: 1197 [2024-10-11 13:13:38,220 INFO L226 Difference]: Without dead ends: 599 [2024-10-11 13:13:38,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:38,222 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:38,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-10-11 13:13:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2024-10-11 13:13:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 522 states have (on average 1.3735632183908046) internal successors, (717), 531 states have internal predecessors, (717), 65 states have call successors, (65), 11 states have call predecessors, (65), 11 states have return successors, (65), 56 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 13:13:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 847 transitions. [2024-10-11 13:13:38,269 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 847 transitions. Word has length 117 [2024-10-11 13:13:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:38,269 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 847 transitions. [2024-10-11 13:13:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 847 transitions. [2024-10-11 13:13:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 13:13:38,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:38,272 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:38,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 13:13:38,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:38,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:38,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1923407269, now seen corresponding path program 1 times [2024-10-11 13:13:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:38,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102359321] [2024-10-11 13:13:38,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:38,477 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-11 13:13:38,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:38,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:38,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:38,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:13:38,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:38,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:13:38,769 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 19 treesize of output 1 [2024-10-11 13:13:38,779 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 19 treesize of output 1 [2024-10-11 13:13:38,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 53 [2024-10-11 13:13:38,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:38,977 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 119 treesize of output 47 [2024-10-11 13:13:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:39,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:39,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:39,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102359321] [2024-10-11 13:13:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102359321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:13:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261104939] [2024-10-11 13:13:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:39,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:13:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:13:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:13:39,091 INFO L87 Difference]: Start difference. First operand 599 states and 847 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:39,649 INFO L93 Difference]: Finished difference Result 1544 states and 2177 transitions. [2024-10-11 13:13:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:13:39,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 13:13:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:39,658 INFO L225 Difference]: With dead ends: 1544 [2024-10-11 13:13:39,658 INFO L226 Difference]: Without dead ends: 946 [2024-10-11 13:13:39,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:13:39,662 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:39,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 927 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:13:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-10-11 13:13:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 938. [2024-10-11 13:13:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 831 states have (on average 1.364620938628159) internal successors, (1134), 846 states have internal predecessors, (1134), 89 states have call successors, (89), 17 states have call predecessors, (89), 17 states have return successors, (89), 74 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-11 13:13:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1312 transitions. [2024-10-11 13:13:39,720 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1312 transitions. Word has length 118 [2024-10-11 13:13:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:39,720 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1312 transitions. [2024-10-11 13:13:39,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1312 transitions. [2024-10-11 13:13:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 13:13:39,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:39,741 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:39,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:13:39,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:39,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:39,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash 189464348, now seen corresponding path program 1 times [2024-10-11 13:13:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:39,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576914797] [2024-10-11 13:13:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:39,943 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-11 13:13:39,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:39,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:39,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:40,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:13:40,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-11 13:13:40,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:40,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:40,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576914797] [2024-10-11 13:13:40,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576914797] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:40,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:13:40,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-11 13:13:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369742308] [2024-10-11 13:13:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:40,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:13:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:13:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:13:40,511 INFO L87 Difference]: Start difference. First operand 938 states and 1312 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:40,688 INFO L93 Difference]: Finished difference Result 1901 states and 2642 transitions. [2024-10-11 13:13:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:13:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 13:13:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:40,698 INFO L225 Difference]: With dead ends: 1901 [2024-10-11 13:13:40,698 INFO L226 Difference]: Without dead ends: 964 [2024-10-11 13:13:40,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:13:40,701 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 56 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:40,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 509 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:13:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-10-11 13:13:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2024-10-11 13:13:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 849 states have (on average 1.3498233215547704) internal successors, (1146), 864 states have internal predecessors, (1146), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 74 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-11 13:13:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1324 transitions. [2024-10-11 13:13:40,767 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1324 transitions. Word has length 118 [2024-10-11 13:13:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:40,767 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1324 transitions. [2024-10-11 13:13:40,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1324 transitions. [2024-10-11 13:13:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 13:13:40,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:40,771 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:40,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 13:13:40,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:40,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:40,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -397341666, now seen corresponding path program 1 times [2024-10-11 13:13:40,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:40,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121798137] [2024-10-11 13:13:40,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:40,973 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-11 13:13:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:40,974 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:40,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:41,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 13:13:41,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:41,377 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 19 treesize of output 1 [2024-10-11 13:13:41,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:13:42,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:42,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-10-11 13:13:42,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:42,600 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 175 treesize of output 67 [2024-10-11 13:13:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 192 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 13:13:42,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:43,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121798137] [2024-10-11 13:13:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121798137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1441350342] [2024-10-11 13:13:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:43,282 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:13:43,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:13:43,284 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:13:43,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-11 13:13:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:44,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 13:13:44,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:44,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:13:45,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-11 13:13:46,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:46,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 63 [2024-10-11 13:13:46,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:46,105 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 139 treesize of output 67 [2024-10-11 13:13:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 192 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 13:13:46,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1441350342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:46,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:13:46,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-11 13:13:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62546661] [2024-10-11 13:13:46,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:13:46,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 13:13:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 13:13:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:13:46,528 INFO L87 Difference]: Start difference. First operand 962 states and 1324 transitions. Second operand has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:13:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:48,957 INFO L93 Difference]: Finished difference Result 1915 states and 2633 transitions. [2024-10-11 13:13:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:13:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 118 [2024-10-11 13:13:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:48,963 INFO L225 Difference]: With dead ends: 1915 [2024-10-11 13:13:48,964 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 13:13:48,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 358 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 13:13:48,968 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 375 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:48,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1523 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 13:13:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 13:13:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 946. [2024-10-11 13:13:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 833 states have (on average 1.346938775510204) internal successors, (1122), 848 states have internal predecessors, (1122), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 74 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-11 13:13:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1300 transitions. [2024-10-11 13:13:49,036 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1300 transitions. Word has length 118 [2024-10-11 13:13:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:49,036 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1300 transitions. [2024-10-11 13:13:49,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:13:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1300 transitions. [2024-10-11 13:13:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 13:13:49,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:49,040 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:49,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-10-11 13:13:49,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 13:13:49,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:49,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:49,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2142261987, now seen corresponding path program 1 times [2024-10-11 13:13:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:49,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630996343] [2024-10-11 13:13:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:49,442 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-11 13:13:49,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:49,443 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:49,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 13:13:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:49,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:13:49,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:49,747 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 8 treesize of output 1 [2024-10-11 13:13:49,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-10-11 13:13:49,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-10-11 13:13:50,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-11 13:13:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 13:13:50,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:50,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:50,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630996343] [2024-10-11 13:13:50,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630996343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:50,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:50,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:13:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596888893] [2024-10-11 13:13:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:50,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:13:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:50,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:13:50,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:13:50,430 INFO L87 Difference]: Start difference. First operand 946 states and 1300 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:51,261 INFO L93 Difference]: Finished difference Result 2715 states and 3724 transitions. [2024-10-11 13:13:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:13:51,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-11 13:13:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:51,270 INFO L225 Difference]: With dead ends: 2715 [2024-10-11 13:13:51,270 INFO L226 Difference]: Without dead ends: 1770 [2024-10-11 13:13:51,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:13:51,273 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 277 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:51,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 538 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:13:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-10-11 13:13:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1423. [2024-10-11 13:13:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1240 states have (on average 1.3459677419354839) internal successors, (1669), 1268 states have internal predecessors, (1669), 146 states have call successors, (146), 36 states have call predecessors, (146), 36 states have return successors, (146), 118 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 13:13:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1961 transitions. [2024-10-11 13:13:51,354 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1961 transitions. Word has length 118 [2024-10-11 13:13:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:51,354 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1961 transitions. [2024-10-11 13:13:51,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1961 transitions. [2024-10-11 13:13:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 13:13:51,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:51,358 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:51,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 13:13:51,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:51,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:51,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2113761697, now seen corresponding path program 1 times [2024-10-11 13:13:51,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:51,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377859758] [2024-10-11 13:13:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:51,560 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-11 13:13:51,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:51,561 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:51,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 13:13:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:51,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:13:51,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 13:13:51,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:51,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377859758] [2024-10-11 13:13:51,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377859758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:51,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:51,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:13:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850143025] [2024-10-11 13:13:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:51,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:13:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:13:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:51,831 INFO L87 Difference]: Start difference. First operand 1423 states and 1961 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:51,923 INFO L93 Difference]: Finished difference Result 2845 states and 3921 transitions. [2024-10-11 13:13:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:13:51,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-11 13:13:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:51,931 INFO L225 Difference]: With dead ends: 2845 [2024-10-11 13:13:51,932 INFO L226 Difference]: Without dead ends: 1423 [2024-10-11 13:13:51,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:13:51,936 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:51,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:13:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-10-11 13:13:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2024-10-11 13:13:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1240 states have (on average 1.3411290322580645) internal successors, (1663), 1268 states have internal predecessors, (1663), 146 states have call successors, (146), 36 states have call predecessors, (146), 36 states have return successors, (146), 118 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 13:13:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1955 transitions. [2024-10-11 13:13:52,013 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1955 transitions. Word has length 118 [2024-10-11 13:13:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:52,013 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1955 transitions. [2024-10-11 13:13:52,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:13:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1955 transitions. [2024-10-11 13:13:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:52,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:52,018 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:52,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 13:13:52,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:52,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:52,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:52,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1704304554, now seen corresponding path program 1 times [2024-10-11 13:13:52,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:52,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174717132] [2024-10-11 13:13:52,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:52,226 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-11 13:13:52,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:52,229 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:52,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 13:13:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:52,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:13:52,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:52,586 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 19 treesize of output 1 [2024-10-11 13:13:52,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2024-10-11 13:13:53,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:53,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2024-10-11 13:13:53,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:53,399 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 167 treesize of output 59 [2024-10-11 13:13:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 192 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 13:13:53,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:13:53,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:53,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174717132] [2024-10-11 13:13:53,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174717132] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:53,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:13:53,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-11 13:13:53,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709519095] [2024-10-11 13:13:53,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:53,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:13:53,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:53,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:13:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:13:53,706 INFO L87 Difference]: Start difference. First operand 1423 states and 1955 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:54,169 INFO L93 Difference]: Finished difference Result 3107 states and 4258 transitions. [2024-10-11 13:13:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:13:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-11 13:13:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:54,180 INFO L225 Difference]: With dead ends: 3107 [2024-10-11 13:13:54,180 INFO L226 Difference]: Without dead ends: 1685 [2024-10-11 13:13:54,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:13:54,186 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 140 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:54,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 445 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:13:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-10-11 13:13:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1341. [2024-10-11 13:13:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1156 states have (on average 1.3261245674740485) internal successors, (1533), 1184 states have internal predecessors, (1533), 146 states have call successors, (146), 38 states have call predecessors, (146), 38 states have return successors, (146), 118 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 13:13:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1825 transitions. [2024-10-11 13:13:54,277 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1825 transitions. Word has length 119 [2024-10-11 13:13:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:54,277 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1825 transitions. [2024-10-11 13:13:54,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:13:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1825 transitions. [2024-10-11 13:13:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:13:54,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:54,284 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:13:54,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 13:13:54,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:54,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:54,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash 269913807, now seen corresponding path program 1 times [2024-10-11 13:13:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:54,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354904717] [2024-10-11 13:13:54,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:54,487 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-11 13:13:54,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:54,491 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:13:54,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 13:13:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:54,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:13:54,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:54,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:13:55,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-10-11 13:13:55,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-10-11 13:13:55,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-10-11 13:13:55,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:55,465 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 194 treesize of output 80 [2024-10-11 13:13:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 13:13:55,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:55,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354904717] [2024-10-11 13:13:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354904717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1758528622] [2024-10-11 13:13:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:55,629 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:13:55,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:13:55,630 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:13:55,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-10-11 13:13:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:56,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 13:13:56,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:56,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2024-10-11 13:13:57,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-11 13:13:57,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-11 13:13:57,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-10-11 13:13:57,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:57,761 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 176 treesize of output 80 [2024-10-11 13:13:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 13:13:57,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:13:57,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1758528622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:13:57,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:13:57,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-10-11 13:13:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545992990] [2024-10-11 13:13:57,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:13:57,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:13:57,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:13:57,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:13:57,845 INFO L87 Difference]: Start difference. First operand 1341 states and 1825 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 16 states have internal predecessors, (98), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-11 13:14:00,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:00,804 INFO L93 Difference]: Finished difference Result 3748 states and 5063 transitions. [2024-10-11 13:14:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 13:14:00,806 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 16 states have internal predecessors, (98), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 119 [2024-10-11 13:14:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:00,816 INFO L225 Difference]: With dead ends: 3748 [2024-10-11 13:14:00,817 INFO L226 Difference]: Without dead ends: 2408 [2024-10-11 13:14:00,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:14:00,821 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 517 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:00,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1817 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 13:14:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2024-10-11 13:14:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1359. [2024-10-11 13:14:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1166 states have (on average 1.320754716981132) internal successors, (1540), 1195 states have internal predecessors, (1540), 150 states have call successors, (150), 42 states have call predecessors, (150), 42 states have return successors, (150), 121 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-11 13:14:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1840 transitions. [2024-10-11 13:14:00,939 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1840 transitions. Word has length 119 [2024-10-11 13:14:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:00,939 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1840 transitions. [2024-10-11 13:14:00,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 16 states have internal predecessors, (98), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-11 13:14:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1840 transitions. [2024-10-11 13:14:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:14:00,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:00,942 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:14:00,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-10-11 13:14:01,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 13:14:01,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:01,343 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:01,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash -991989724, now seen corresponding path program 1 times [2024-10-11 13:14:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079429941] [2024-10-11 13:14:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:01,344 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-11 13:14:01,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:01,346 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:01,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 13:14:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:01,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:14:01,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:01,697 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 19 treesize of output 1 [2024-10-11 13:14:01,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2024-10-11 13:14:02,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:02,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2024-10-11 13:14:02,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:02,588 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 167 treesize of output 59 [2024-10-11 13:14:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 192 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 13:14:02,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:14:02,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079429941] [2024-10-11 13:14:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079429941] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:14:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-11 13:14:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755652888] [2024-10-11 13:14:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:02,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:14:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:02,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:14:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:14:02,860 INFO L87 Difference]: Start difference. First operand 1359 states and 1840 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:14:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:03,334 INFO L93 Difference]: Finished difference Result 2723 states and 3662 transitions. [2024-10-11 13:14:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:14:03,336 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-11 13:14:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:03,342 INFO L225 Difference]: With dead ends: 2723 [2024-10-11 13:14:03,343 INFO L226 Difference]: Without dead ends: 1381 [2024-10-11 13:14:03,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:14:03,349 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 142 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:03,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 396 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:14:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-10-11 13:14:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 687. [2024-10-11 13:14:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 566 states have (on average 1.2862190812720848) internal successors, (728), 579 states have internal predecessors, (728), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 13:14:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 908 transitions. [2024-10-11 13:14:03,423 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 908 transitions. Word has length 120 [2024-10-11 13:14:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:03,424 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 908 transitions. [2024-10-11 13:14:03,424 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:14:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 908 transitions. [2024-10-11 13:14:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:14:03,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:03,426 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:14:03,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 13:14:03,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:03,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:03,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1247640545, now seen corresponding path program 1 times [2024-10-11 13:14:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457819697] [2024-10-11 13:14:03,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:03,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:03,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:03,629 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:03,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 13:14:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:03,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:14:03,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:14:03,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:03,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:03,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457819697] [2024-10-11 13:14:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457819697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:03,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:03,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:03,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139201007] [2024-10-11 13:14:03,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:03,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:03,925 INFO L87 Difference]: Start difference. First operand 687 states and 908 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 13:14:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:04,120 INFO L93 Difference]: Finished difference Result 1393 states and 1835 transitions. [2024-10-11 13:14:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2024-10-11 13:14:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:04,126 INFO L225 Difference]: With dead ends: 1393 [2024-10-11 13:14:04,126 INFO L226 Difference]: Without dead ends: 719 [2024-10-11 13:14:04,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:04,130 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:04,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 541 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-11 13:14:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 687. [2024-10-11 13:14:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 566 states have (on average 1.2826855123674912) internal successors, (726), 579 states have internal predecessors, (726), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 13:14:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 906 transitions. [2024-10-11 13:14:04,198 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 906 transitions. Word has length 120 [2024-10-11 13:14:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:04,198 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 906 transitions. [2024-10-11 13:14:04,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 13:14:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 906 transitions. [2024-10-11 13:14:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:14:04,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:04,200 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:14:04,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-11 13:14:04,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:04,401 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:04,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 692941469, now seen corresponding path program 1 times [2024-10-11 13:14:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:04,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124656684] [2024-10-11 13:14:04,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:04,402 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-11 13:14:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:04,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:04,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 13:14:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:04,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 13:14:04,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:04,723 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 8 treesize of output 1 [2024-10-11 13:14:04,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 13:14:04,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 13:14:05,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 13:14:05,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-11 13:14:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:14:05,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:14:05,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124656684] [2024-10-11 13:14:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124656684] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:14:05,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:14:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 13:14:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469450297] [2024-10-11 13:14:05,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:14:05,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:14:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:14:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:14:05,437 INFO L87 Difference]: Start difference. First operand 687 states and 906 transitions. Second operand has 15 states, 13 states have (on average 7.923076923076923) internal successors, (103), 15 states have internal predecessors, (103), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:14:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:06,413 INFO L93 Difference]: Finished difference Result 1422 states and 1863 transitions. [2024-10-11 13:14:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:14:06,414 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.923076923076923) internal successors, (103), 15 states have internal predecessors, (103), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) Word has length 120 [2024-10-11 13:14:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:06,419 INFO L225 Difference]: With dead ends: 1422 [2024-10-11 13:14:06,419 INFO L226 Difference]: Without dead ends: 731 [2024-10-11 13:14:06,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:14:06,422 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 175 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:06,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1000 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:14:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-11 13:14:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 584. [2024-10-11 13:14:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 475 states have (on average 1.2610526315789474) internal successors, (599), 485 states have internal predecessors, (599), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 13:14:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 759 transitions. [2024-10-11 13:14:06,473 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 759 transitions. Word has length 120 [2024-10-11 13:14:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:06,474 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 759 transitions. [2024-10-11 13:14:06,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.923076923076923) internal successors, (103), 15 states have internal predecessors, (103), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:14:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 759 transitions. [2024-10-11 13:14:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:14:06,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:06,477 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:14:06,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-11 13:14:06,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:06,678 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:06,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash 106135455, now seen corresponding path program 1 times [2024-10-11 13:14:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985541092] [2024-10-11 13:14:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:06,679 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-11 13:14:06,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:06,682 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:06,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 13:14:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:06,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:14:06,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:07,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:14:07,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-10-11 13:14:07,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-10-11 13:14:07,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-10-11 13:14:07,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:07,577 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 140 treesize of output 56 [2024-10-11 13:14:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 13:14:07,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:07,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985541092] [2024-10-11 13:14:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985541092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [685412381] [2024-10-11 13:14:07,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:07,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:14:07,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:14:07,905 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:14:07,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-11 13:14:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 13:14:09,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:09,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:14:09,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-11 13:14:09,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-11 13:14:10,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2024-10-11 13:14:11,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:11,070 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 152 treesize of output 68 [2024-10-11 13:14:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 13:14:11,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:11,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [685412381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:11,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:14:11,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2024-10-11 13:14:11,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428308171] [2024-10-11 13:14:11,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:14:11,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 13:14:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:11,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 13:14:11,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 13:14:11,545 INFO L87 Difference]: Start difference. First operand 584 states and 759 transitions. Second operand has 28 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:14:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:14,663 INFO L93 Difference]: Finished difference Result 1289 states and 1677 transitions. [2024-10-11 13:14:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 13:14:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) Word has length 120 [2024-10-11 13:14:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:14,667 INFO L225 Difference]: With dead ends: 1289 [2024-10-11 13:14:14,667 INFO L226 Difference]: Without dead ends: 722 [2024-10-11 13:14:14,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 249 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=376, Invalid=1880, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 13:14:14,669 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 335 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:14,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1690 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 13:14:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-10-11 13:14:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 582. [2024-10-11 13:14:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 473 states have (on average 1.26215644820296) internal successors, (597), 483 states have internal predecessors, (597), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 13:14:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 757 transitions. [2024-10-11 13:14:14,722 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 757 transitions. Word has length 120 [2024-10-11 13:14:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:14,723 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 757 transitions. [2024-10-11 13:14:14,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:14:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 757 transitions. [2024-10-11 13:14:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:14:14,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:14,726 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:14:14,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-11 13:14:14,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:15,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:14:15,127 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:15,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1507142745, now seen corresponding path program 1 times [2024-10-11 13:14:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:15,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879746473] [2024-10-11 13:14:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:15,128 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-11 13:14:15,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:15,129 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:15,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-11 13:14:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:15,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:14:15,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-11 13:14:15,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:14:15,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879746473] [2024-10-11 13:14:15,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879746473] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:15,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:14:15,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-11 13:14:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470941730] [2024-10-11 13:14:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:15,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:14:15,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:15,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:14:15,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:14:15,738 INFO L87 Difference]: Start difference. First operand 582 states and 757 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:14:15,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:15,832 INFO L93 Difference]: Finished difference Result 1149 states and 1496 transitions. [2024-10-11 13:14:15,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:14:15,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-11 13:14:15,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:15,835 INFO L225 Difference]: With dead ends: 1149 [2024-10-11 13:14:15,835 INFO L226 Difference]: Without dead ends: 584 [2024-10-11 13:14:15,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:14:15,837 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 98 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:15,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 384 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-11 13:14:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2024-10-11 13:14:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 473 states have (on average 1.2600422832980973) internal successors, (596), 483 states have internal predecessors, (596), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 13:14:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 756 transitions. [2024-10-11 13:14:15,890 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 756 transitions. Word has length 121 [2024-10-11 13:14:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:15,891 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 756 transitions. [2024-10-11 13:14:15,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:14:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 756 transitions. [2024-10-11 13:14:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:14:15,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:15,893 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:14:15,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:16,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:16,094 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1248977307, now seen corresponding path program 1 times [2024-10-11 13:14:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206906149] [2024-10-11 13:14:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:16,095 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-11 13:14:16,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:16,096 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:16,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-11 13:14:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:16,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 13:14:16,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:16,428 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 8 treesize of output 1 [2024-10-11 13:14:16,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2024-10-11 13:14:16,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:16,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 42 [2024-10-11 13:14:17,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:17,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 55 [2024-10-11 13:14:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 225 proven. 36 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-10-11 13:14:17,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:14:17,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206906149] [2024-10-11 13:14:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206906149] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:14:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [22] total 24 [2024-10-11 13:14:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155606633] [2024-10-11 13:14:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:17,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:14:17,808 INFO L87 Difference]: Start difference. First operand 582 states and 756 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:14:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:18,123 INFO L93 Difference]: Finished difference Result 1158 states and 1504 transitions. [2024-10-11 13:14:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:14:18,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-11 13:14:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:18,128 INFO L225 Difference]: With dead ends: 1158 [2024-10-11 13:14:18,128 INFO L226 Difference]: Without dead ends: 593 [2024-10-11 13:14:18,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:14:18,130 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 91 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:18,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 758 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-11 13:14:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 585. [2024-10-11 13:14:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 476 states have (on average 1.2584033613445378) internal successors, (599), 486 states have internal predecessors, (599), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 13:14:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2024-10-11 13:14:18,182 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 121 [2024-10-11 13:14:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:18,183 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2024-10-11 13:14:18,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:14:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2024-10-11 13:14:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:14:18,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:18,185 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:14:18,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-11 13:14:18,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:18,386 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:18,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1709349291, now seen corresponding path program 1 times [2024-10-11 13:14:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864284273] [2024-10-11 13:14:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:18,387 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-11 13:14:18,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:18,389 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:14:18,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-11 13:14:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:14:18,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:18,733 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 8 treesize of output 1 [2024-10-11 13:14:18,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-10-11 13:14:18,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-10-11 13:14:19,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-10-11 13:14:19,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:19,237 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 192 treesize of output 78 [2024-10-11 13:14:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 13:14:19,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:19,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:19,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864284273] [2024-10-11 13:14:19,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864284273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:19,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [65460091] [2024-10-11 13:14:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:19,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:14:19,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:14:19,411 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:14:19,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-10-11 13:14:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:14:20,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:20,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2024-10-11 13:14:21,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-11 13:14:21,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-11 13:14:21,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2024-10-11 13:14:22,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:22,042 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 174 treesize of output 78 [2024-10-11 13:14:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 13:14:22,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [65460091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:22,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:14:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2024-10-11 13:14:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372659728] [2024-10-11 13:14:22,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:14:22,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 13:14:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 13:14:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:14:22,148 INFO L87 Difference]: Start difference. First operand 585 states and 759 transitions. Second operand has 25 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:14:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:27,890 INFO L93 Difference]: Finished difference Result 2170 states and 2812 transitions. [2024-10-11 13:14:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 13:14:27,891 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) Word has length 121 [2024-10-11 13:14:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:27,898 INFO L225 Difference]: With dead ends: 2170 [2024-10-11 13:14:27,898 INFO L226 Difference]: Without dead ends: 1602 [2024-10-11 13:14:27,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=685, Invalid=3605, Unknown=0, NotChecked=0, Total=4290 [2024-10-11 13:14:27,905 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 998 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:27,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 2523 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 13:14:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2024-10-11 13:14:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 537. [2024-10-11 13:14:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 428 states have (on average 1.2453271028037383) internal successors, (533), 438 states have internal predecessors, (533), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 13:14:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 693 transitions. [2024-10-11 13:14:27,980 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 693 transitions. Word has length 121 [2024-10-11 13:14:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:27,981 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 693 transitions. [2024-10-11 13:14:27,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:14:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 693 transitions. [2024-10-11 13:14:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 13:14:27,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:27,985 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:14:27,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:28,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0