./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-69.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-69.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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:20:05,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:20:05,442 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:20:05,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:20:05,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:20:05,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:20:05,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:20:05,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:20:05,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:20:05,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:20:05,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:20:05,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:20:05,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:20:05,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:20:05,483 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:20:05,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:20:05,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:20:05,484 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:20:05,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:20:05,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:20:05,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:20:05,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:20:05,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:20:05,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:20:05,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:20:05,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:20:05,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:20:05,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:20:05,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:20:05,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:20:05,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:20:05,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:20:05,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:20:05,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:20:05,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:20:05,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:20:05,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:20:05,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:20:05,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:20:05,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:20:05,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:20:05,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:20:05,500 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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2024-10-11 13:20:05,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:20:05,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:20:05,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:20:05,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:20:05,831 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:20:05,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-10-11 13:20:07,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:20:07,621 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:20:07,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-10-11 13:20:07,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f6ea49d3b/3306de56837e4395be9e1f4a78a89e48/FLAGec6455367 [2024-10-11 13:20:07,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f6ea49d3b/3306de56837e4395be9e1f4a78a89e48 [2024-10-11 13:20:07,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:20:07,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:20:07,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:20:07,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:20:07,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:20:07,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:20:07" (1/1) ... [2024-10-11 13:20:07,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72dea4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:07, skipping insertion in model container [2024-10-11 13:20:07,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:20:07" (1/1) ... [2024-10-11 13:20:08,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:20:08,191 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-69.i[916,929] [2024-10-11 13:20:08,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:20:08,293 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:20:08,307 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-69.i[916,929] [2024-10-11 13:20:08,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:20:08,423 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:20:08,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08 WrapperNode [2024-10-11 13:20:08,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:20:08,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:20:08,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:20:08,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:20:08,442 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:20:08" (1/1) ... [2024-10-11 13:20:08,460 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:20:08" (1/1) ... [2024-10-11 13:20:08,524 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-10-11 13:20:08,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:20:08,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:20:08,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:20:08,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:20:08,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,570 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2024-10-11 13:20:08,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:20:08,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:20:08,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:20:08,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:20:08,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (1/1) ... [2024-10-11 13:20:08,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:20:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:20:08,660 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:20:08,671 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:20:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:20:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:20:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:20:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:20:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:20:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:20:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:20:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:20:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:20:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:20:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:20:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:20:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:20:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:20:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:20:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:20:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:20:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:20:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:20:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:20:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:20:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:20:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:20:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:20:08,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:20:08,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:20:08,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:20:08,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:20:08,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:20:08,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:20:08,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:20:08,733 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:20:08,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:20:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:20:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:20:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:20:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:20:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:20:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:20:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:20:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:20:08,893 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:20:08,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:20:09,489 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-11 13:20:09,490 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:20:09,524 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:20:09,524 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:20:09,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:20:09 BoogieIcfgContainer [2024-10-11 13:20:09,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:20:09,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:20:09,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:20:09,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:20:09,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:20:07" (1/3) ... [2024-10-11 13:20:09,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e160608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:20:09, skipping insertion in model container [2024-10-11 13:20:09,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:08" (2/3) ... [2024-10-11 13:20:09,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e160608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:20:09, skipping insertion in model container [2024-10-11 13:20:09,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:20:09" (3/3) ... [2024-10-11 13:20:09,537 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2024-10-11 13:20:09,555 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:20:09,556 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:20:09,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:20:09,646 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;@4a2958cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:20:09,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:20:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:20:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:20:09,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:09,669 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:09,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1533142486, now seen corresponding path program 1 times [2024-10-11 13:20:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344723151] [2024-10-11 13:20:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:20:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:20:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:20:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:20:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:20:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:20:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:20:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:20:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:20:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:20:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:20:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:20:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:20:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:20:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:20:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344723151] [2024-10-11 13:20:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344723151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:10,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:10,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:20:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37021320] [2024-10-11 13:20:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:10,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:20:10,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:20:10,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:20:10,122 INFO L87 Difference]: Start difference. First operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:20:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:10,175 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2024-10-11 13:20:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:20:10,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-11 13:20:10,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:10,189 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:20:10,190 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 13:20:10,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:20:10,199 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:10,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:20:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 13:20:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 13:20:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:20:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-11 13:20:10,315 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 114 [2024-10-11 13:20:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:10,315 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-11 13:20:10,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:20:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-11 13:20:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:20:10,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:10,320 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:10,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:20:10,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:10,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:10,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1404825800, now seen corresponding path program 1 times [2024-10-11 13:20:10,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:10,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512090074] [2024-10-11 13:20:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:10,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:20:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:20:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:20:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:20:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:20:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:20:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:20:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:20:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:20:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:20:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:20:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:20:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:20:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:20:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:20:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512090074] [2024-10-11 13:20:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512090074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:10,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:20:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62350824] [2024-10-11 13:20:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:10,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:20:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:10,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:20:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:20:10,826 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:10,894 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-10-11 13:20:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:20:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-11 13:20:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:10,897 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:20:10,899 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 13:20:10,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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:20:10,901 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:10,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:20:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 13:20:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 13:20:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:20:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-11 13:20:10,925 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 114 [2024-10-11 13:20:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:10,927 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-11 13:20:10,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-11 13:20:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:20:10,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:10,932 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:10,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:20:10,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:10,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:10,934 INFO L85 PathProgramCache]: Analyzing trace with hash -452400419, now seen corresponding path program 1 times [2024-10-11 13:20:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:10,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284070396] [2024-10-11 13:20:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:20:11,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152412865] [2024-10-11 13:20:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:20:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:20:11,160 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:20:11,162 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:20:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:11,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 13:20:11,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:11,629 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 9 treesize of output 3 [2024-10-11 13:20:11,668 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:20:11,678 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:20:11,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:11,893 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 51 treesize of output 19 [2024-10-11 13:20:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:11,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:11,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284070396] [2024-10-11 13:20:11,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:20:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152412865] [2024-10-11 13:20:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152412865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:20:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362429639] [2024-10-11 13:20:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:11,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:20:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:20:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:20:11,924 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:12,426 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-10-11 13:20:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:20:12,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:20:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:12,431 INFO L225 Difference]: With dead ends: 237 [2024-10-11 13:20:12,431 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 13:20:12,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:20:12,435 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 84 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:12,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 869 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:20:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 13:20:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-10-11 13:20:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 124 states have internal predecessors, (174), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:20:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-10-11 13:20:12,470 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 116 [2024-10-11 13:20:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:12,470 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-10-11 13:20:12,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-10-11 13:20:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:20:12,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:12,473 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:12,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:20:12,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:20:12,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:12,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash -194234981, now seen corresponding path program 1 times [2024-10-11 13:20:12,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:12,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333903480] [2024-10-11 13:20:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:20:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:20:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:20:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:20:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:20:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:20:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:20:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:20:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:20:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:20:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:20:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:20:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:20:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:20:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:20:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:13,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333903480] [2024-10-11 13:20:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333903480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:13,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:13,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:20:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779199027] [2024-10-11 13:20:13,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:13,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:20:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:13,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:20:13,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:20:13,322 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:13,606 INFO L93 Difference]: Finished difference Result 354 states and 520 transitions. [2024-10-11 13:20:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:20:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:20:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:13,611 INFO L225 Difference]: With dead ends: 354 [2024-10-11 13:20:13,612 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 13:20:13,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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:20:13,616 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 88 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:13,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 545 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:20:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 13:20:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-10-11 13:20:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.4023668639053255) internal successors, (237), 171 states have internal predecessors, (237), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:20:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 299 transitions. [2024-10-11 13:20:13,656 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 299 transitions. Word has length 116 [2024-10-11 13:20:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:13,657 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 299 transitions. [2024-10-11 13:20:13,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 299 transitions. [2024-10-11 13:20:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:20:13,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:13,660 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:13,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:20:13,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:13,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1848422171, now seen corresponding path program 1 times [2024-10-11 13:20:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881376396] [2024-10-11 13:20:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:20:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:20:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:20:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:20:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:20:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:20:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:20:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:20:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:20:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:20:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:20:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:20:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:20:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:20:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:20:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:14,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881376396] [2024-10-11 13:20:14,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881376396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:14,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:14,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:20:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570967065] [2024-10-11 13:20:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:14,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:20:14,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:14,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:20:14,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:20:14,303 INFO L87 Difference]: Start difference. First operand 204 states and 299 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:15,010 INFO L93 Difference]: Finished difference Result 612 states and 885 transitions. [2024-10-11 13:20:15,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:20:15,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:20:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:15,014 INFO L225 Difference]: With dead ends: 612 [2024-10-11 13:20:15,014 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 13:20:15,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:20:15,016 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 283 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:15,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 811 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:20:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 13:20:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 290. [2024-10-11 13:20:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 243 states have (on average 1.3950617283950617) internal successors, (339), 246 states have internal predecessors, (339), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:20:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 419 transitions. [2024-10-11 13:20:15,071 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 419 transitions. Word has length 116 [2024-10-11 13:20:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:15,071 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 419 transitions. [2024-10-11 13:20:15,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 419 transitions. [2024-10-11 13:20:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:20:15,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:15,074 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:20:15,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:15,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2106587609, now seen corresponding path program 1 times [2024-10-11 13:20:15,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:15,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499850785] [2024-10-11 13:20:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:15,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:20:15,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069489503] [2024-10-11 13:20:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:15,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:20:15,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:20:15,166 INFO L229 MonitoredProcess]: Starting monitored process 3 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:20:15,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:20:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:15,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 13:20:15,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:15,556 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:20:15,562 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:20:15,573 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:20:15,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:15,716 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 51 treesize of output 19 [2024-10-11 13:20:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:15,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:15,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499850785] [2024-10-11 13:20:15,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:20:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069489503] [2024-10-11 13:20:15,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069489503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:15,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:15,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:20:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581179971] [2024-10-11 13:20:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:15,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:20:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:20:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:20:15,740 INFO L87 Difference]: Start difference. First operand 290 states and 419 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:16,194 INFO L93 Difference]: Finished difference Result 689 states and 994 transitions. [2024-10-11 13:20:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:20:16,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:20:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:16,201 INFO L225 Difference]: With dead ends: 689 [2024-10-11 13:20:16,201 INFO L226 Difference]: Without dead ends: 400 [2024-10-11 13:20:16,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:20:16,203 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 75 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:16,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1045 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:20:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-11 13:20:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 302. [2024-10-11 13:20:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 255 states have (on average 1.4) internal successors, (357), 258 states have internal predecessors, (357), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:20:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 437 transitions. [2024-10-11 13:20:16,249 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 437 transitions. Word has length 116 [2024-10-11 13:20:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:16,249 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 437 transitions. [2024-10-11 13:20:16,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 437 transitions. [2024-10-11 13:20:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:20:16,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:16,252 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:16,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 13:20:16,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:20:16,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:16,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash -90664594, now seen corresponding path program 1 times [2024-10-11 13:20:16,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:16,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619378868] [2024-10-11 13:20:16,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:16,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:20:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:20:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:20:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:20:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:20:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:20:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:20:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:20:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:20:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:20:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:20:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:20:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:20:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:20:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:20:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:16,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619378868] [2024-10-11 13:20:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619378868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:16,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:16,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:20:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790294949] [2024-10-11 13:20:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:16,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:20:16,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:20:16,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:20:16,812 INFO L87 Difference]: Start difference. First operand 302 states and 437 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:16,986 INFO L93 Difference]: Finished difference Result 671 states and 964 transitions. [2024-10-11 13:20:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:20:16,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-11 13:20:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:16,993 INFO L225 Difference]: With dead ends: 671 [2024-10-11 13:20:16,995 INFO L226 Difference]: Without dead ends: 370 [2024-10-11 13:20:16,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:20:16,997 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 106 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 932 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:20:16,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 932 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:20:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-11 13:20:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 306. [2024-10-11 13:20:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 256 states have (on average 1.390625) internal successors, (356), 259 states have internal predecessors, (356), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 13:20:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 440 transitions. [2024-10-11 13:20:17,041 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 440 transitions. Word has length 117 [2024-10-11 13:20:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:17,041 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 440 transitions. [2024-10-11 13:20:17,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 440 transitions. [2024-10-11 13:20:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:20:17,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:17,043 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:17,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:20:17,043 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1350584819, now seen corresponding path program 1 times [2024-10-11 13:20:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826483024] [2024-10-11 13:20:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:20:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:20:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:20:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:20:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:20:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:20:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:20:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:20:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:20:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:20:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:20:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:20:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:20:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:20:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:20:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:17,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826483024] [2024-10-11 13:20:17,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826483024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:17,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:17,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:20:17,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266905447] [2024-10-11 13:20:17,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:17,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:20:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:17,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:20:17,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:20:17,575 INFO L87 Difference]: Start difference. First operand 306 states and 440 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:17,729 INFO L93 Difference]: Finished difference Result 771 states and 1103 transitions. [2024-10-11 13:20:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:20:17,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-11 13:20:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:17,733 INFO L225 Difference]: With dead ends: 771 [2024-10-11 13:20:17,733 INFO L226 Difference]: Without dead ends: 466 [2024-10-11 13:20:17,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:20:17,735 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 74 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:17,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 628 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:20:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-11 13:20:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 461. [2024-10-11 13:20:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 392 states have (on average 1.3826530612244898) internal successors, (542), 398 states have internal predecessors, (542), 57 states have call successors, (57), 11 states have call predecessors, (57), 11 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 13:20:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 656 transitions. [2024-10-11 13:20:17,788 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 656 transitions. Word has length 117 [2024-10-11 13:20:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:17,788 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 656 transitions. [2024-10-11 13:20:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 656 transitions. [2024-10-11 13:20:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:20:17,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:17,790 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:17,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:20:17,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:17,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1979290188, now seen corresponding path program 1 times [2024-10-11 13:20:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182902429] [2024-10-11 13:20:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:20:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471081064] [2024-10-11 13:20:17,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:17,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:20:17,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:20:17,887 INFO L229 MonitoredProcess]: Starting monitored process 4 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:20:17,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 13:20:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:18,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:20:18,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:18,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:20:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182902429] [2024-10-11 13:20:18,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:20:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471081064] [2024-10-11 13:20:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471081064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:18,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:18,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:20:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517763152] [2024-10-11 13:20:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:18,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:20:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:20:18,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:20:18,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:20:18,479 INFO L87 Difference]: Start difference. First operand 461 states and 656 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:19,024 INFO L93 Difference]: Finished difference Result 1176 states and 1675 transitions. [2024-10-11 13:20:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:20:19,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-11 13:20:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:19,031 INFO L225 Difference]: With dead ends: 1176 [2024-10-11 13:20:19,032 INFO L226 Difference]: Without dead ends: 731 [2024-10-11 13:20:19,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:20:19,035 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 84 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:19,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 405 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:20:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-11 13:20:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 591. [2024-10-11 13:20:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 514 states have (on average 1.3929961089494163) internal successors, (716), 521 states have internal predecessors, (716), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 57 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 13:20:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 844 transitions. [2024-10-11 13:20:19,106 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 844 transitions. Word has length 120 [2024-10-11 13:20:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:19,107 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 844 transitions. [2024-10-11 13:20:19,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 844 transitions. [2024-10-11 13:20:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:20:19,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:19,109 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:19,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 13:20:19,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:20:19,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:19,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:19,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1614612530, now seen corresponding path program 1 times [2024-10-11 13:20:19,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:20:19,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082758128] [2024-10-11 13:20:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:19,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:20:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:20:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724406173] [2024-10-11 13:20:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:19,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:20:19,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:20:19,433 INFO L229 MonitoredProcess]: Starting monitored process 5 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:20:19,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 13:20:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:20:19,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:20:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:20:20,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:20:20,031 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:20:20,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:20:20,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:20:20,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 13:20:20,243 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:20:20,360 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:20:20,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:20:20 BoogieIcfgContainer [2024-10-11 13:20:20,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:20:20,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:20:20,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:20:20,365 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:20:20,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:20:09" (3/4) ... [2024-10-11 13:20:20,368 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:20:20,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:20:20,370 INFO L158 Benchmark]: Toolchain (without parser) took 12402.70ms. Allocated memory was 159.4MB in the beginning and 312.5MB in the end (delta: 153.1MB). Free memory was 88.3MB in the beginning and 235.1MB in the end (delta: -146.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-11 13:20:20,370 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:20:20,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.36ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 127.9MB in the end (delta: -39.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-11 13:20:20,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.04ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 127.8MB in the beginning and 171.3MB in the end (delta: -43.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-11 13:20:20,372 INFO L158 Benchmark]: Boogie Preprocessor took 93.56ms. Allocated memory is still 203.4MB. Free memory was 171.3MB in the beginning and 166.9MB in the end (delta: 4.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:20:20,372 INFO L158 Benchmark]: RCFGBuilder took 905.81ms. Allocated memory is still 203.4MB. Free memory was 166.9MB in the beginning and 129.4MB in the end (delta: 37.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 13:20:20,372 INFO L158 Benchmark]: TraceAbstraction took 10836.50ms. Allocated memory was 203.4MB in the beginning and 312.5MB in the end (delta: 109.1MB). Free memory was 128.3MB in the beginning and 235.1MB in the end (delta: -106.8MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-11 13:20:20,373 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 312.5MB. Free memory is still 235.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:20:20,374 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.33ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.36ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 127.9MB in the end (delta: -39.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.04ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 127.8MB in the beginning and 171.3MB in the end (delta: -43.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.56ms. Allocated memory is still 203.4MB. Free memory was 171.3MB in the beginning and 166.9MB in the end (delta: 4.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 905.81ms. Allocated memory is still 203.4MB. Free memory was 166.9MB in the beginning and 129.4MB in the end (delta: 37.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10836.50ms. Allocated memory was 203.4MB in the beginning and 312.5MB in the end (delta: 109.1MB). Free memory was 128.3MB in the beginning and 235.1MB in the end (delta: -106.8MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 312.5MB. Free memory is still 235.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] double_Array_0[0] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L97] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR unsigned_long_int_Array_0[1][1] [L40] EXPR unsigned_long_int_Array_0[1][0] [L40] EXPR unsigned_long_int_Array_0[0][0] [L40] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L40] EXPR unsigned_long_int_Array_0[0][1] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND TRUE unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]))) [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L53] EXPR unsigned_long_int_Array_0[0][0] [L53] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0][0]; [L54] EXPR unsigned_long_int_Array_0[1][1] [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-4294967296, unsigned_long_int_Array_0={8:0}] [L54] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))); [L55] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L55] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[0][0]) [L62] EXPR BOOL_unsigned_char_Array_0[0] [L62] unsigned char stepLocal_3 = BOOL_unsigned_char_Array_0[0]; [L63] EXPR signed_short_int_Array_0[0] [L63] EXPR signed_char_Array_0[1] [L63] signed long int stepLocal_2 = signed_short_int_Array_0[0] + signed_char_Array_0[1]; [L64] EXPR signed_char_Array_0[1] [L64] EXPR signed_char_Array_0[0] [L64] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] COND FALSE !(((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && stepLocal_3) [L75] EXPR double_Array_0[0] [L75] double_Array_0[1] = double_Array_0[0] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR unsigned_long_int_Array_0[0][0] [L106] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] [L106] EXPR BOOL_unsigned_char_Array_0[0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106-L107] return ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 794 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 5714 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4389 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1659 IncrementalHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 1325 mSDtfsCounter, 1659 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 432 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1638 NumberOfCodeBlocks, 1638 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1037 ConstructedInterpolants, 0 QuantifiedInterpolants, 2639 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1285 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3780/3780 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:20:20,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-69.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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:20:22,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:20:22,916 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:20:22,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:20:22,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:20:22,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:20:22,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:20:22,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:20:22,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:20:22,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:20:22,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:20:22,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:20:22,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:20:22,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:20:22,961 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:20:22,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:20:22,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:20:22,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:20:22,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:20:22,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:20:22,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:20:22,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:20:22,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:20:22,964 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:20:22,965 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:20:22,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:20:22,965 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:20:22,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:20:22,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:20:22,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:20:22,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:20:22,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:20:22,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:20:22,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:20:22,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:20:22,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:20:22,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:20:22,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:20:22,978 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:20:22,978 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:20:22,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:20:22,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:20:22,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:20:22,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:20:22,981 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:20:22,981 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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2024-10-11 13:20:23,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:20:23,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:20:23,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:20:23,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:20:23,377 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:20:23,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-10-11 13:20:24,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:20:25,210 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:20:25,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-10-11 13:20:25,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b13de0074/f13eea0d3b7b43769096d80a40235676/FLAG57f6c39c9 [2024-10-11 13:20:25,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b13de0074/f13eea0d3b7b43769096d80a40235676 [2024-10-11 13:20:25,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:20:25,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:20:25,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:20:25,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:20:25,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:20:25,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112fb617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25, skipping insertion in model container [2024-10-11 13:20:25,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:20:25,496 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-69.i[916,929] [2024-10-11 13:20:25,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:20:25,611 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:20:25,626 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-69.i[916,929] [2024-10-11 13:20:25,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:20:25,732 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:20:25,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25 WrapperNode [2024-10-11 13:20:25,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:20:25,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:20:25,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:20:25,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:20:25,743 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:20:25" (1/1) ... [2024-10-11 13:20:25,765 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:20:25" (1/1) ... [2024-10-11 13:20:25,813 INFO L138 Inliner]: procedures = 36, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-10-11 13:20:25,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:20:25,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:20:25,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:20:25,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:20:25,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,877 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2024-10-11 13:20:25,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:20:25,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:20:25,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:20:25,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:20:25,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (1/1) ... [2024-10-11 13:20:25,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:20:25,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:20:25,961 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:20:25,965 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:20:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:20:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:20:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:20:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:20:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:20:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:20:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:20:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:20:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:20:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:20:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:20:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:20:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:20:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:20:26,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:20:26,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:20:26,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:20:26,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:20:26,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:20:26,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:20:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:20:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:20:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:20:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:20:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:20:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:20:26,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:20:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:20:26,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:20:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:20:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:20:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:20:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:20:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:20:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:20:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:20:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:20:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:20:26,204 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:20:26,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:20:27,025 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-11 13:20:27,026 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:20:27,076 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:20:27,077 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:20:27,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:20:27 BoogieIcfgContainer [2024-10-11 13:20:27,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:20:27,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:20:27,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:20:27,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:20:27,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:20:25" (1/3) ... [2024-10-11 13:20:27,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157f2b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:20:27, skipping insertion in model container [2024-10-11 13:20:27,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:20:25" (2/3) ... [2024-10-11 13:20:27,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157f2b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:20:27, skipping insertion in model container [2024-10-11 13:20:27,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:20:27" (3/3) ... [2024-10-11 13:20:27,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2024-10-11 13:20:27,107 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:20:27,108 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:20:27,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:20:27,179 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;@276cf2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:20:27,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:20:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:20:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:20:27,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:27,202 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1533142486, now seen corresponding path program 1 times [2024-10-11 13:20:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587440564] [2024-10-11 13:20:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:27,223 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:20:27,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:27,225 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:20:27,227 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:20:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:27,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:20:27,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-11 13:20:27,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:27,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587440564] [2024-10-11 13:20:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587440564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:20:27,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261717303] [2024-10-11 13:20:27,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:27,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:20:27,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:20:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:20:27,652 INFO L87 Difference]: Start difference. First operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:20:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:27,704 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2024-10-11 13:20:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:20:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-11 13:20:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:27,715 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:20:27,715 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 13:20:27,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:20:27,725 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:27,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:20:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 13:20:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 13:20:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:20:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-11 13:20:27,785 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 114 [2024-10-11 13:20:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:27,785 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-11 13:20:27,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:20:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-11 13:20:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:20:27,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:27,793 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,804 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:20:27,993 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:20:27,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:27,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1404825800, now seen corresponding path program 1 times [2024-10-11 13:20:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:27,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075899544] [2024-10-11 13:20:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:27,997 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:20:27,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:27,999 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:20:28,000 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:20:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:28,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:20:28,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:28,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:28,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075899544] [2024-10-11 13:20:28,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075899544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:28,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:28,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:20:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767905982] [2024-10-11 13:20:28,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:28,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:20:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:20:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:20:28,383 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:28,456 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-10-11 13:20:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:20:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-11 13:20:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:28,461 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:20:28,463 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 13:20:28,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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:20:28,465 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:28,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:20:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 13:20:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 13:20:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:20:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-11 13:20:28,480 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 114 [2024-10-11 13:20:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:28,481 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-11 13:20:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-11 13:20:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:20:28,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:28,484 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:28,493 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 (3)] Ended with exit code 0 [2024-10-11 13:20:28,684 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:20:28,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:28,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:28,686 INFO L85 PathProgramCache]: Analyzing trace with hash -452400419, now seen corresponding path program 1 times [2024-10-11 13:20:28,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:28,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044435601] [2024-10-11 13:20:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:28,687 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:20:28,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:28,688 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:20:28,689 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:20:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:28,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 13:20:28,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:29,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:29,936 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 48 treesize of output 16 [2024-10-11 13:20:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:30,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:30,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:30,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044435601] [2024-10-11 13:20:30,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044435601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:30,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:30,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:20:30,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089232667] [2024-10-11 13:20:30,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:30,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:20:30,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:30,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:20:30,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:20:30,203 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:32,422 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-10-11 13:20:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:20:32,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:20:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:32,426 INFO L225 Difference]: With dead ends: 237 [2024-10-11 13:20:32,427 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 13:20:32,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:20:32,429 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 84 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:32,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 869 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 13:20:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 13:20:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-10-11 13:20:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 124 states have internal predecessors, (174), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:20:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-10-11 13:20:32,454 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 116 [2024-10-11 13:20:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:32,455 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-10-11 13:20:32,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-10-11 13:20:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:20:32,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:32,457 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:32,467 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 (4)] Ended with exit code 0 [2024-10-11 13:20:32,658 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:20:32,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:32,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash -194234981, now seen corresponding path program 1 times [2024-10-11 13:20:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:32,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824815100] [2024-10-11 13:20:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:32,664 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:20:32,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:32,665 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:20:32,666 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:20:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:32,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:20:32,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:33,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:33,061 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 34 treesize of output 10 [2024-10-11 13:20:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:33,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:33,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:33,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824815100] [2024-10-11 13:20:33,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824815100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:33,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:33,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:20:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224499206] [2024-10-11 13:20:33,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:33,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:20:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:33,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:20:33,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:20:33,087 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:33,604 INFO L93 Difference]: Finished difference Result 354 states and 520 transitions. [2024-10-11 13:20:33,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:20:33,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:20:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:33,609 INFO L225 Difference]: With dead ends: 354 [2024-10-11 13:20:33,609 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 13:20:33,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:20:33,611 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 88 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:33,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 452 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:20:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 13:20:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-10-11 13:20:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.4023668639053255) internal successors, (237), 171 states have internal predecessors, (237), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:20:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 299 transitions. [2024-10-11 13:20:33,631 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 299 transitions. Word has length 116 [2024-10-11 13:20:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:33,631 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 299 transitions. [2024-10-11 13:20:33,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 299 transitions. [2024-10-11 13:20:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:20:33,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:33,633 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,645 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:20:33,834 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:20:33,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:33,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1848422171, now seen corresponding path program 1 times [2024-10-11 13:20:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:33,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239991604] [2024-10-11 13:20:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:33,836 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:20:33,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:33,840 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:20:33,841 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:20:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:34,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:20:34,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:34,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:34,178 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 35 treesize of output 11 [2024-10-11 13:20:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:34,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:34,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:34,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239991604] [2024-10-11 13:20:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239991604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:34,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:20:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451521852] [2024-10-11 13:20:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:34,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:20:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:20:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:20:34,205 INFO L87 Difference]: Start difference. First operand 204 states and 299 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:34,781 INFO L93 Difference]: Finished difference Result 414 states and 602 transitions. [2024-10-11 13:20:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:20:34,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:20:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:34,784 INFO L225 Difference]: With dead ends: 414 [2024-10-11 13:20:34,784 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 13:20:34,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:20:34,788 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 88 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:34,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 576 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:20:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 13:20:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2024-10-11 13:20:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 128 states have internal predecessors, (177), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:20:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-10-11 13:20:34,815 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 116 [2024-10-11 13:20:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:34,819 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-10-11 13:20:34,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-10-11 13:20:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:20:34,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:34,822 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:34,834 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:20:35,022 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:20:35,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2106587609, now seen corresponding path program 1 times [2024-10-11 13:20:35,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:35,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8099427] [2024-10-11 13:20:35,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:35,024 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:20:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:35,025 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:20:35,026 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:20:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:35,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 13:20:35,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:36,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:36,102 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 48 treesize of output 16 [2024-10-11 13:20:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:36,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:36,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8099427] [2024-10-11 13:20:36,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8099427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:36,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:36,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:20:36,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081436707] [2024-10-11 13:20:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:36,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:20:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:36,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:20:36,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:20:36,350 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:38,634 INFO L93 Difference]: Finished difference Result 361 states and 520 transitions. [2024-10-11 13:20:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:20:38,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:20:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:38,640 INFO L225 Difference]: With dead ends: 361 [2024-10-11 13:20:38,640 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 13:20:38,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:20:38,644 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 75 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:38,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1045 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 13:20:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 13:20:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 159. [2024-10-11 13:20:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 134 states have internal predecessors, (186), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:20:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 230 transitions. [2024-10-11 13:20:38,667 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 230 transitions. Word has length 116 [2024-10-11 13:20:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:38,668 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 230 transitions. [2024-10-11 13:20:38,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 230 transitions. [2024-10-11 13:20:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:20:38,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:38,670 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,680 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 (7)] Forceful destruction successful, exit code 0 [2024-10-11 13:20:38,870 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:20:38,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:38,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash -90664594, now seen corresponding path program 1 times [2024-10-11 13:20:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:38,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926563299] [2024-10-11 13:20:38,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:38,873 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:20:38,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:38,874 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:20:38,875 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:20:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:39,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:20:39,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:39,120 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 20 treesize of output 16 [2024-10-11 13:20:39,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2024-10-11 13:20:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:39,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:39,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:39,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926563299] [2024-10-11 13:20:39,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926563299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:39,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:20:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254015764] [2024-10-11 13:20:39,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:39,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:20:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:20:39,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:20:39,243 INFO L87 Difference]: Start difference. First operand 159 states and 230 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:39,532 INFO L93 Difference]: Finished difference Result 368 states and 530 transitions. [2024-10-11 13:20:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:20:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-11 13:20:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:39,534 INFO L225 Difference]: With dead ends: 368 [2024-10-11 13:20:39,534 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 13:20:39,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:20:39,535 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 106 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 932 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:39,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 932 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:20:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 13:20:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 157. [2024-10-11 13:20:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 132 states have internal predecessors, (183), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:20:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 227 transitions. [2024-10-11 13:20:39,547 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 227 transitions. Word has length 117 [2024-10-11 13:20:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:39,548 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 227 transitions. [2024-10-11 13:20:39,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 227 transitions. [2024-10-11 13:20:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:20:39,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:39,550 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,560 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:20:39,750 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 [2024-10-11 13:20:39,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:39,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1350584819, now seen corresponding path program 1 times [2024-10-11 13:20:39,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:39,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336175706] [2024-10-11 13:20:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:39,752 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:20:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:39,753 INFO L229 MonitoredProcess]: Starting monitored process 9 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:20:39,754 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 (9)] Waiting until timeout for monitored process [2024-10-11 13:20:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:40,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:20:40,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:40,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:40,462 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 48 treesize of output 16 [2024-10-11 13:20:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:40,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:40,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:40,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336175706] [2024-10-11 13:20:40,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336175706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:40,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:40,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:20:40,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410348134] [2024-10-11 13:20:40,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:40,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:20:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:40,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:20:40,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:20:40,636 INFO L87 Difference]: Start difference. First operand 157 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:42,023 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2024-10-11 13:20:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:20:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-11 13:20:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:42,027 INFO L225 Difference]: With dead ends: 448 [2024-10-11 13:20:42,028 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 13:20:42,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:20:42,030 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 85 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:42,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 474 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:20:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 13:20:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 202. [2024-10-11 13:20:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 177 states have internal predecessors, (251), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:20:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 295 transitions. [2024-10-11 13:20:42,043 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 295 transitions. Word has length 117 [2024-10-11 13:20:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:42,044 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 295 transitions. [2024-10-11 13:20:42,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 295 transitions. [2024-10-11 13:20:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:20:42,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:42,047 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,060 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 (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:20:42,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:20:42,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:42,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2135035851, now seen corresponding path program 1 times [2024-10-11 13:20:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:42,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630502954] [2024-10-11 13:20:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:42,249 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:20:42,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:42,251 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:20:42,251 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:20:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:42,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:20:42,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:42,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:20:42,889 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 28 treesize of output 23 [2024-10-11 13:20:43,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:43,063 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 65 treesize of output 35 [2024-10-11 13:20:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:20:43,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:43,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:43,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630502954] [2024-10-11 13:20:43,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630502954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:43,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:43,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:20:43,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834331475] [2024-10-11 13:20:43,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:43,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:20:43,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:43,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:20:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:20:43,115 INFO L87 Difference]: Start difference. First operand 202 states and 295 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:20:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:43,614 INFO L93 Difference]: Finished difference Result 574 states and 835 transitions. [2024-10-11 13:20:43,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:20:43,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2024-10-11 13:20:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:43,617 INFO L225 Difference]: With dead ends: 574 [2024-10-11 13:20:43,617 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 13:20:43,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:20:43,619 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 208 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:43,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 574 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:20:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 13:20:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2024-10-11 13:20:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 331 states have (on average 1.4259818731117824) internal successors, (472), 334 states have internal predecessors, (472), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:20:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 536 transitions. [2024-10-11 13:20:43,640 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 536 transitions. Word has length 117 [2024-10-11 13:20:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:43,640 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 536 transitions. [2024-10-11 13:20:43,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:20:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 536 transitions. [2024-10-11 13:20:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:20:43,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:43,642 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,651 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:20:43,842 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:20:43,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1614612530, now seen corresponding path program 1 times [2024-10-11 13:20:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920857207] [2024-10-11 13:20:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:43,844 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:20:43,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:43,845 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:20:43,846 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:20:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:44,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:20:44,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:44,278 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:20:45,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:45,213 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 172 treesize of output 98 [2024-10-11 13:20:45,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:45,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 368 treesize of output 134 [2024-10-11 13:20:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-11 13:20:45,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:20:46,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920857207] [2024-10-11 13:20:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920857207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:20:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1314937461] [2024-10-11 13:20:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:46,467 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:20:46,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:20:46,470 INFO L229 MonitoredProcess]: Starting monitored process 12 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:20:46,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-11 13:20:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:47,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:20:47,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:47,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 13:20:49,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:49,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 100 [2024-10-11 13:20:50,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:50,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 299 treesize of output 151 [2024-10-11 13:20:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-11 13:20:50,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:20:50,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1314937461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:20:50,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:20:50,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-10-11 13:20:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761548485] [2024-10-11 13:20:50,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:20:50,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:20:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:50,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:20:50,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:20:50,536 INFO L87 Difference]: Start difference. First operand 369 states and 536 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, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-11 13:20:54,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:20:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:55,755 INFO L93 Difference]: Finished difference Result 755 states and 1080 transitions. [2024-10-11 13:20:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:20:55,757 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, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 120 [2024-10-11 13:20:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:55,763 INFO L225 Difference]: With dead ends: 755 [2024-10-11 13:20:55,763 INFO L226 Difference]: Without dead ends: 753 [2024-10-11 13:20:55,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:20:55,764 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 460 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:55,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1196 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 13:20:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-11 13:20:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 747. [2024-10-11 13:20:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 668 states have (on average 1.410179640718563) internal successors, (942), 678 states have internal predecessors, (942), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 54 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 13:20:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1070 transitions. [2024-10-11 13:20:55,823 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1070 transitions. Word has length 120 [2024-10-11 13:20:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:55,823 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1070 transitions. [2024-10-11 13:20:55,824 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, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-11 13:20:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1070 transitions. [2024-10-11 13:20:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:20:55,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:55,828 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-10-11 13:20:56,037 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 (11)] Ended with exit code 0 [2024-10-11 13:20:56,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:20:56,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1298436787, now seen corresponding path program 1 times [2024-10-11 13:20:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009513834] [2024-10-11 13:20:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:56,231 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:20:56,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:56,232 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:20:56,233 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:20:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:56,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:20:56,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:56,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:56,601 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 34 treesize of output 10 [2024-10-11 13:20:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:56,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:56,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:56,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009513834] [2024-10-11 13:20:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009513834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:56,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:56,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:20:56,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759858297] [2024-10-11 13:20:56,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:56,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:20:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:56,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:20:56,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:20:56,621 INFO L87 Difference]: Start difference. First operand 747 states and 1070 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:57,329 INFO L93 Difference]: Finished difference Result 1722 states and 2448 transitions. [2024-10-11 13:20:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:20:57,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-11 13:20:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:57,337 INFO L225 Difference]: With dead ends: 1722 [2024-10-11 13:20:57,337 INFO L226 Difference]: Without dead ends: 976 [2024-10-11 13:20:57,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:20:57,344 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 79 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:57,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 483 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:20:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-11 13:20:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 972. [2024-10-11 13:20:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 852 states have (on average 1.3873239436619718) internal successors, (1182), 867 states have internal predecessors, (1182), 96 states have call successors, (96), 23 states have call predecessors, (96), 23 states have return successors, (96), 81 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 13:20:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1374 transitions. [2024-10-11 13:20:57,430 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1374 transitions. Word has length 120 [2024-10-11 13:20:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:57,431 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1374 transitions. [2024-10-11 13:20:57,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1374 transitions. [2024-10-11 13:20:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:20:57,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:57,434 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:57,444 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 (13)] Ended with exit code 0 [2024-10-11 13:20:57,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:20:57,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:57,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2063649867, now seen corresponding path program 1 times [2024-10-11 13:20:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:57,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188400524] [2024-10-11 13:20:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:57,636 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:20:57,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:57,639 INFO L229 MonitoredProcess]: Starting monitored process 14 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:20:57,641 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 (14)] Waiting until timeout for monitored process [2024-10-11 13:20:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:57,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:20:57,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:57,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:57,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188400524] [2024-10-11 13:20:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188400524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:57,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:20:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698977242] [2024-10-11 13:20:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:57,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:20:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:57,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:20:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:20:57,908 INFO L87 Difference]: Start difference. First operand 972 states and 1374 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:57,998 INFO L93 Difference]: Finished difference Result 1921 states and 2715 transitions. [2024-10-11 13:20:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:20:57,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-11 13:20:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:58,007 INFO L225 Difference]: With dead ends: 1921 [2024-10-11 13:20:58,008 INFO L226 Difference]: Without dead ends: 976 [2024-10-11 13:20:58,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:20:58,010 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:58,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:20:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-11 13:20:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-11 13:20:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 856 states have (on average 1.3855140186915889) internal successors, (1186), 871 states have internal predecessors, (1186), 96 states have call successors, (96), 23 states have call predecessors, (96), 23 states have return successors, (96), 81 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 13:20:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1378 transitions. [2024-10-11 13:20:58,077 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1378 transitions. Word has length 120 [2024-10-11 13:20:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:58,077 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1378 transitions. [2024-10-11 13:20:58,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1378 transitions. [2024-10-11 13:20:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:20:58,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:58,081 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,091 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 (14)] Ended with exit code 0 [2024-10-11 13:20:58,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:20:58,287 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:58,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 425879095, now seen corresponding path program 1 times [2024-10-11 13:20:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617584316] [2024-10-11 13:20:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:58,288 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:20:58,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:58,291 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:20:58,293 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:20:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:20:58,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:20:58,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:20:58,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:20:58,643 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 35 treesize of output 11 [2024-10-11 13:20:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:20:58,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:20:58,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:20:58,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617584316] [2024-10-11 13:20:58,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617584316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:20:58,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:20:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:20:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275249266] [2024-10-11 13:20:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:20:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:20:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:20:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:20:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:20:58,659 INFO L87 Difference]: Start difference. First operand 976 states and 1378 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:20:59,624 INFO L93 Difference]: Finished difference Result 2127 states and 2986 transitions. [2024-10-11 13:20:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:20:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-11 13:20:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:20:59,631 INFO L225 Difference]: With dead ends: 2127 [2024-10-11 13:20:59,631 INFO L226 Difference]: Without dead ends: 1178 [2024-10-11 13:20:59,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:20:59,634 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 90 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:20:59,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 773 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:20:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2024-10-11 13:20:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1158. [2024-10-11 13:20:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1002 states have (on average 1.3732534930139721) internal successors, (1376), 1023 states have internal predecessors, (1376), 124 states have call successors, (124), 31 states have call predecessors, (124), 31 states have return successors, (124), 103 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 13:20:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1624 transitions. [2024-10-11 13:20:59,725 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1624 transitions. Word has length 120 [2024-10-11 13:20:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:20:59,726 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1624 transitions. [2024-10-11 13:20:59,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:20:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1624 transitions. [2024-10-11 13:20:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:20:59,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:20:59,729 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,740 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 (15)] Forceful destruction successful, exit code 0 [2024-10-11 13:20:59,929 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:20:59,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:20:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:20:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2140049975, now seen corresponding path program 1 times [2024-10-11 13:20:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:20:59,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460200285] [2024-10-11 13:20:59,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:20:59,930 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:20:59,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:20:59,932 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:20:59,933 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