./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s2lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s2lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --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 b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:07:09,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:07:09,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:07:09,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:07:09,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:07:09,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:07:09,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:07:09,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:07:09,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:07:09,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:07:09,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:07:09,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:07:09,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:07:09,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:07:09,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:07:09,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:07:09,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:07:09,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:07:09,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:07:09,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:07:09,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:07:09,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:07:09,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:07:09,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:07:09,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:07:09,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:07:09,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:07:09,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:07:09,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:07:09,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:07:09,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:07:09,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:07:09,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:07:09,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:07:09,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:07:09,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:07:09,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:07:09,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:07:09,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:07:09,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:07:09,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:07:09,724 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:07:09,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:07:09,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:07:09,760 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:07:09,760 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:07:09,761 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:07:09,761 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:07:09,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:07:09,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:07:09,762 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:07:09,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:07:09,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:07:09,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:07:09,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:07:09,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:07:09,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:07:09,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:07:09,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:07:09,765 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:07:09,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:07:09,765 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:07:09,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:07:09,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:07:09,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:07:09,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:07:09,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:07:09,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:07:09,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:07:09,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:07:09,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:07:09,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:07:09,768 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:07:09,768 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:07:09,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:07:09,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f [2022-11-20 11:07:10,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:07:10,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:07:10,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:07:10,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:07:10,084 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:07:10,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-fpi/s2lif.c [2022-11-20 11:07:13,142 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:07:13,320 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:07:13,320 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/sv-benchmarks/c/array-fpi/s2lif.c [2022-11-20 11:07:13,326 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/data/0bfa6892a/231fcbc79bc24946b921d93b58e3e134/FLAG0ef82eaed [2022-11-20 11:07:13,341 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/data/0bfa6892a/231fcbc79bc24946b921d93b58e3e134 [2022-11-20 11:07:13,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:07:13,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:07:13,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:07:13,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:07:13,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:07:13,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a0f09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13, skipping insertion in model container [2022-11-20 11:07:13,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:07:13,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:07:13,559 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-11-20 11:07:13,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:07:13,588 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:07:13,601 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-11-20 11:07:13,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:07:13,622 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:07:13,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13 WrapperNode [2022-11-20 11:07:13,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:07:13,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:07:13,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:07:13,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:07:13,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,659 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-11-20 11:07:13,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:07:13,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:07:13,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:07:13,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:07:13,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:07:13,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:07:13,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:07:13,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:07:13,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (1/1) ... [2022-11-20 11:07:13,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:07:13,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:13,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:07:13,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:07:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:07:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:07:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:07:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:07:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:07:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:07:13,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:07:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:07:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:07:13,848 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:07:13,850 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:07:14,100 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:07:14,121 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:07:14,124 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 11:07:14,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:07:14 BoogieIcfgContainer [2022-11-20 11:07:14,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:07:14,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:07:14,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:07:14,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:07:14,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:07:13" (1/3) ... [2022-11-20 11:07:14,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdc55f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:07:14, skipping insertion in model container [2022-11-20 11:07:14,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:13" (2/3) ... [2022-11-20 11:07:14,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdc55f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:07:14, skipping insertion in model container [2022-11-20 11:07:14,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:07:14" (3/3) ... [2022-11-20 11:07:14,152 INFO L112 eAbstractionObserver]: Analyzing ICFG s2lif.c [2022-11-20 11:07:14,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:07:14,189 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:07:14,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:07:14,288 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@741e74ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:07:14,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:07:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:07:14,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:14,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:07:14,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:14,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-20 11:07:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:14,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453665201] [2022-11-20 11:07:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:07:14,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453665201] [2022-11-20 11:07:14,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453665201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:14,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:14,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:07:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349763840] [2022-11-20 11:07:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:14,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:07:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:14,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:07:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:07:14,524 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:14,559 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-20 11:07:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:07:14,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:07:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:14,570 INFO L225 Difference]: With dead ends: 40 [2022-11-20 11:07:14,571 INFO L226 Difference]: Without dead ends: 18 [2022-11-20 11:07:14,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:07:14,580 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:14,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:07:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-20 11:07:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 11:07:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-20 11:07:14,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-20 11:07:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:14,624 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-20 11:07:14,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-20 11:07:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:07:14,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:14,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:07:14,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:07:14,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-20 11:07:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:14,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803377464] [2022-11-20 11:07:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:07:14,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:14,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803377464] [2022-11-20 11:07:14,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803377464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:14,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:14,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:07:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472239727] [2022-11-20 11:07:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:14,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:07:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:07:14,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:07:14,833 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:14,905 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-20 11:07:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:07:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:07:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:14,906 INFO L225 Difference]: With dead ends: 36 [2022-11-20 11:07:14,907 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 11:07:14,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:07:14,909 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:14,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:07:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 11:07:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-20 11:07:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-20 11:07:14,916 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-20 11:07:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:14,916 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-20 11:07:14,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-20 11:07:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:07:14,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:14,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:07:14,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:07:14,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:14,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-20 11:07:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:14,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113052248] [2022-11-20 11:07:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:07:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:16,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113052248] [2022-11-20 11:07:16,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113052248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:07:16,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509418850] [2022-11-20 11:07:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:16,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:16,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:16,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:07:16,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:07:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:16,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-20 11:07:16,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:07:16,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 11:07:16,742 INFO L350 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 11 treesize of output 7 [2022-11-20 11:07:16,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:07:17,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-20 11:07:17,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-20 11:07:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:07:17,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:07:17,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:07:17,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-11-20 11:07:17,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:07:17,758 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-20 11:07:17,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:07:17,766 INFO L350 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 22 treesize of output 14 [2022-11-20 11:07:17,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 10 [2022-11-20 11:07:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:07:17,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509418850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:07:17,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:07:17,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-11-20 11:07:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584324040] [2022-11-20 11:07:17,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:07:17,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 11:07:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 11:07:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-11-20 11:07:17,797 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:18,113 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-20 11:07:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:07:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 11:07:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:18,116 INFO L225 Difference]: With dead ends: 46 [2022-11-20 11:07:18,116 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:07:18,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 11:07:18,118 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:18,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 57 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-11-20 11:07:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:07:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-11-20 11:07:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-11-20 11:07:18,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2022-11-20 11:07:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:18,128 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-11-20 11:07:18,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-11-20 11:07:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:07:18,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:18,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:07:18,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:07:18,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:18,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-20 11:07:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:18,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304826627] [2022-11-20 11:07:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:18,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:18,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304826627] [2022-11-20 11:07:18,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304826627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:07:18,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776259667] [2022-11-20 11:07:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:18,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:18,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:07:18,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:07:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:18,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:07:18,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:07:18,723 INFO L350 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 18 treesize of output 14 [2022-11-20 11:07:18,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:07:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:18,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:07:18,798 INFO L350 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 14 treesize of output 12 [2022-11-20 11:07:18,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-20 11:07:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:18,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776259667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:07:18,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:07:18,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-20 11:07:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527239001] [2022-11-20 11:07:18,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:07:18,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:07:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:18,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:07:18,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:07:18,817 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:18,933 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-11-20 11:07:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:07:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 11:07:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:18,934 INFO L225 Difference]: With dead ends: 49 [2022-11-20 11:07:18,935 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 11:07:18,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:07:18,936 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:18,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:07:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 11:07:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-20 11:07:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-11-20 11:07:18,944 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 20 [2022-11-20 11:07:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:18,945 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-11-20 11:07:18,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-11-20 11:07:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:07:18,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:18,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:07:18,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:07:19,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:19,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:19,153 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-20 11:07:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:19,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654905866] [2022-11-20 11:07:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:19,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:19,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:19,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654905866] [2022-11-20 11:07:19,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654905866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:07:19,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454367798] [2022-11-20 11:07:19,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:07:19,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:19,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:07:19,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:07:19,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:07:19,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:07:19,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:07:19,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:07:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:19,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:07:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:19,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454367798] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:07:19,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:07:19,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 11:07:19,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716055008] [2022-11-20 11:07:19,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:07:19,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:07:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:07:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:07:19,435 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:19,578 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-20 11:07:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:07:19,579 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:07:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:19,580 INFO L225 Difference]: With dead ends: 70 [2022-11-20 11:07:19,580 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 11:07:19,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:07:19,581 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:19,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 25 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:07:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 11:07:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-11-20 11:07:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 11:07:19,589 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-20 11:07:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:19,589 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 11:07:19,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 11:07:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:07:19,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:19,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:07:19,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:07:19,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:19,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-20 11:07:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:19,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805961214] [2022-11-20 11:07:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805961214] [2022-11-20 11:07:19,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805961214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:07:19,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357219128] [2022-11-20 11:07:19,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:07:19,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:19,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:19,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:07:19,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:07:20,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:07:20,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:07:20,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:07:20,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:07:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:20,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:07:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:07:20,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357219128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:07:20,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:07:20,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 11:07:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909514810] [2022-11-20 11:07:20,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:07:20,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:07:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:07:20,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:07:20,159 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:20,303 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-20 11:07:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:07:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:07:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:20,305 INFO L225 Difference]: With dead ends: 39 [2022-11-20 11:07:20,305 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 11:07:20,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:07:20,306 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:20,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 27 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:07:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 11:07:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-20 11:07:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-20 11:07:20,312 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-11-20 11:07:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:20,313 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-20 11:07:20,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:07:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-20 11:07:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:07:20,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:20,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:07:20,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:07:20,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 11:07:20,520 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-20 11:07:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:20,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713588107] [2022-11-20 11:07:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:20,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:07:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:22,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713588107] [2022-11-20 11:07:22,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713588107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:07:22,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759232128] [2022-11-20 11:07:22,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:07:22,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:22,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:22,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:07:22,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:07:22,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:07:22,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:07:22,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-20 11:07:22,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:07:22,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 11:07:22,541 INFO L350 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 11 treesize of output 7 [2022-11-20 11:07:22,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:07:22,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:07:22,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-20 11:07:23,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:07:23,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-11-20 11:07:23,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:07:23,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:07:23,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-11-20 11:07:23,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-11-20 11:07:23,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-11-20 11:07:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:07:23,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:07:24,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:07:24,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-11-20 11:07:34,099 WARN L233 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:07:46,345 WARN L233 SmtUtils]: Spent 11.99s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:07:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:07:46,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759232128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:07:46,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:07:46,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 50 [2022-11-20 11:07:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386595828] [2022-11-20 11:07:46,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:07:46,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 11:07:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 11:07:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2068, Unknown=0, NotChecked=0, Total=2450 [2022-11-20 11:07:46,461 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:08:08,646 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-11-20 11:08:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-20 11:08:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:08:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:08:08,648 INFO L225 Difference]: With dead ends: 93 [2022-11-20 11:08:08,648 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 11:08:08,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2362 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=1246, Invalid=6410, Unknown=0, NotChecked=0, Total=7656 [2022-11-20 11:08:08,652 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 99 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:08:08,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 95 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 627 Invalid, 0 Unknown, 125 Unchecked, 3.1s Time] [2022-11-20 11:08:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 11:08:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-11-20 11:08:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-11-20 11:08:08,667 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 27 [2022-11-20 11:08:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:08:08,667 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-11-20 11:08:08,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-11-20 11:08:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:08:08,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:08:08,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:08:08,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:08:08,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:08,876 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:08:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:08:08,876 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-20 11:08:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:08:08,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145074171] [2022-11-20 11:08:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:08:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:08:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:08:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:08:09,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145074171] [2022-11-20 11:08:09,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145074171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:08:09,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331293570] [2022-11-20 11:08:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:08:09,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:09,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:08:09,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:08:09,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:08:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:09,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 11:08:09,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:08:09,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 11:08:09,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:09,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 11:08:09,766 INFO L350 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 19 treesize of output 7 [2022-11-20 11:08:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:08:09,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:08:09,908 INFO L350 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 16 treesize of output 14 [2022-11-20 11:08:09,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 16 [2022-11-20 11:08:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:08:09,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331293570] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:08:09,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:08:09,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-11-20 11:08:09,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398785372] [2022-11-20 11:08:09,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:08:09,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:08:09,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:08:09,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:08:09,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:08:09,969 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:08:10,411 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2022-11-20 11:08:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:08:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:08:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:08:10,413 INFO L225 Difference]: With dead ends: 79 [2022-11-20 11:08:10,413 INFO L226 Difference]: Without dead ends: 55 [2022-11-20 11:08:10,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:08:10,414 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:08:10,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 64 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:08:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-20 11:08:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-11-20 11:08:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-11-20 11:08:10,440 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2022-11-20 11:08:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:08:10,442 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-11-20 11:08:10,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-11-20 11:08:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:08:10,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:08:10,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:08:10,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:08:10,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:10,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:08:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:08:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-11-20 11:08:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:08:10,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909514638] [2022-11-20 11:08:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:08:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:08:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:08:10,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:08:10,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909514638] [2022-11-20 11:08:10,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909514638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:08:10,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600095455] [2022-11-20 11:08:10,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:08:10,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:10,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:08:10,870 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:08:10,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:08:10,974 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 11:08:10,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:08:10,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:08:10,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:08:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:08:11,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:08:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:08:11,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600095455] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:08:11,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:08:11,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-20 11:08:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169673548] [2022-11-20 11:08:11,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:08:11,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:08:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:08:11,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:08:11,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:08:11,430 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:08:11,882 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-11-20 11:08:11,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:08:11,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 11:08:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:08:11,884 INFO L225 Difference]: With dead ends: 91 [2022-11-20 11:08:11,884 INFO L226 Difference]: Without dead ends: 53 [2022-11-20 11:08:11,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:08:11,885 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:08:11,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 41 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:08:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-20 11:08:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-11-20 11:08:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-20 11:08:11,896 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-11-20 11:08:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:08:11,897 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-20 11:08:11,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-20 11:08:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:08:11,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:08:11,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:08:11,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 11:08:12,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:12,099 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:08:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:08:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-11-20 11:08:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:08:12,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883068205] [2022-11-20 11:08:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:08:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:08:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:08:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:08:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883068205] [2022-11-20 11:08:12,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883068205] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:08:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010577105] [2022-11-20 11:08:12,334 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:08:12,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:12,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:08:12,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:08:12,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:08:12,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-20 11:08:12,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:08:12,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:08:12,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:08:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:08:12,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:08:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:08:12,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010577105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:08:12,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:08:12,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-20 11:08:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132700538] [2022-11-20 11:08:12,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:08:12,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:08:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:08:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:08:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:08:12,815 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:08:13,230 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-20 11:08:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:08:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 11:08:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:08:13,231 INFO L225 Difference]: With dead ends: 48 [2022-11-20 11:08:13,231 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 11:08:13,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:08:13,233 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 81 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:08:13,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 24 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:08:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 11:08:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-20 11:08:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-20 11:08:13,255 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-11-20 11:08:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:08:13,256 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-20 11:08:13,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-20 11:08:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:08:13,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:08:13,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:08:13,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:08:13,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:08:13,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:08:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:08:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-11-20 11:08:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:08:13,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908019329] [2022-11-20 11:08:13,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:08:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:08:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:08:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:08:17,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908019329] [2022-11-20 11:08:17,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908019329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:08:17,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054716276] [2022-11-20 11:08:17,600 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 11:08:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:17,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:08:17,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:08:17,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:08:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:17,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 11:08:17,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:08:17,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:08:17,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 11:08:17,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:08:17,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:08:17,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:08:18,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-20 11:08:18,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:18,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-11-20 11:08:19,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:19,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:19,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-11-20 11:08:19,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:08:19,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:19,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:19,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 11:08:20,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:20,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:20,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:20,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:08:20,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-11-20 11:08:20,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2022-11-20 11:08:20,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2022-11-20 11:08:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:08:20,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:08:28,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:08:28,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-11-20 11:08:30,956 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse6 1)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< .cse6 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 1)))))) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))))) is different from false [2022-11-20 11:08:33,587 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 2 .cse2) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse2 4)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))))) is different from false [2022-11-20 11:08:36,303 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ 7 .cse6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 5 .cse6) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))))) is different from false [2022-11-20 11:08:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-20 11:08:36,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054716276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:08:36,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:08:36,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 62 [2022-11-20 11:08:36,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382751542] [2022-11-20 11:08:36,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:08:36,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-20 11:08:36,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:08:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-20 11:08:36,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=3048, Unknown=3, NotChecked=348, Total=3782 [2022-11-20 11:08:36,459 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:39,211 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ 7 .cse6)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 5 .cse6) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse18 .cse1)) (.cse11 (select .cse18 .cse0)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse11 1)) (not (= .cse12 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse17)) .cse1 (+ .cse12 2)) .cse0 (+ .cse11 2))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 2 .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse14 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse17))))) (* c_~N~0 3)) (not (= .cse17 1))))))) is different from false [2022-11-20 11:08:41,418 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 2 .cse2) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse2 4)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse18 .cse1)) (.cse11 (select .cse18 .cse0)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse11 1)) (not (= .cse12 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse17)) .cse1 (+ .cse12 2)) .cse0 (+ .cse11 2))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 2 .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse14 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse17))))) (* c_~N~0 3)) (not (= .cse17 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-20 11:09:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:09:00,320 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-11-20 11:09:00,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 11:09:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 11:09:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:09:00,322 INFO L225 Difference]: With dead ends: 73 [2022-11-20 11:09:00,322 INFO L226 Difference]: Without dead ends: 69 [2022-11-20 11:09:00,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=561, Invalid=4010, Unknown=5, NotChecked=680, Total=5256 [2022-11-20 11:09:00,324 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:09:00,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 125 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 918 Invalid, 0 Unknown, 193 Unchecked, 5.1s Time] [2022-11-20 11:09:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-20 11:09:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-11-20 11:09:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-20 11:09:00,338 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2022-11-20 11:09:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:09:00,338 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-20 11:09:00,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-20 11:09:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:09:00,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:09:00,339 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:09:00,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:09:00,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:09:00,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:09:00,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:09:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-11-20 11:09:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:09:00,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548767442] [2022-11-20 11:09:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:09:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:09:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:09:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:09:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:09:01,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548767442] [2022-11-20 11:09:01,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548767442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:09:01,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652203750] [2022-11-20 11:09:01,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:09:01,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:09:01,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:09:01,783 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:09:01,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:09:01,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:09:01,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:09:01,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 11:09:01,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:09:02,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:09:02,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:02,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 11:09:02,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:02,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 11:09:02,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:09:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:09:02,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:09:03,362 INFO L350 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 16 treesize of output 14 [2022-11-20 11:09:03,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 16 [2022-11-20 11:09:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:09:03,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652203750] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:09:03,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:09:03,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-11-20 11:09:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214447425] [2022-11-20 11:09:03,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:09:03,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 11:09:03,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:09:03,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 11:09:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-11-20 11:09:03,582 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:09:05,868 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-11-20 11:09:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 11:09:05,869 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 11:09:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:09:05,869 INFO L225 Difference]: With dead ends: 76 [2022-11-20 11:09:05,869 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 11:09:05,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 11:09:05,870 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:09:05,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 73 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 11:09:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 11:09:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-11-20 11:09:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-20 11:09:05,884 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2022-11-20 11:09:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:09:05,884 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-20 11:09:05,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-20 11:09:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:09:05,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:09:05,885 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:09:05,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:09:06,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 11:09:06,086 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:09:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:09:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-11-20 11:09:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:09:06,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562512325] [2022-11-20 11:09:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:09:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:09:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:09:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:09:06,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:09:06,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562512325] [2022-11-20 11:09:06,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562512325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:09:06,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764329711] [2022-11-20 11:09:06,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:09:06,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:09:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:09:06,502 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:09:06,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:09:06,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:09:06,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:09:06,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:09:06,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:09:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:09:07,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:09:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:09:07,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764329711] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:09:07,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:09:07,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 11:09:07,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958648908] [2022-11-20 11:09:07,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:09:07,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:09:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:09:07,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:09:07,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:09:07,525 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:09:08,395 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-11-20 11:09:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:09:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 11:09:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:09:08,396 INFO L225 Difference]: With dead ends: 102 [2022-11-20 11:09:08,396 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 11:09:08,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:09:08,397 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:09:08,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 42 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:09:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 11:09:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-20 11:09:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-20 11:09:08,412 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-11-20 11:09:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:09:08,412 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-20 11:09:08,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-20 11:09:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:09:08,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:09:08,416 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:09:08,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:09:08,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:09:08,619 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:09:08,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:09:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-11-20 11:09:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:09:08,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363605293] [2022-11-20 11:09:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:09:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:09:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:09:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:09:09,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:09:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363605293] [2022-11-20 11:09:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363605293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:09:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234324681] [2022-11-20 11:09:09,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:09:09,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:09:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:09:09,119 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:09:09,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:09:09,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 11:09:09,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:09:09,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:09:09,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:09:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:09:09,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:09:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:09:10,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234324681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:09:10,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:09:10,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 11:09:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439551128] [2022-11-20 11:09:10,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:09:10,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:09:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:09:10,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:09:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:09:10,109 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:09:11,075 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-11-20 11:09:11,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:09:11,075 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 11:09:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:09:11,076 INFO L225 Difference]: With dead ends: 57 [2022-11-20 11:09:11,076 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 11:09:11,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-20 11:09:11,077 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 101 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:09:11,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 24 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:09:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 11:09:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-11-20 11:09:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-20 11:09:11,087 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-11-20 11:09:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:09:11,088 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-20 11:09:11,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:09:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-20 11:09:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:09:11,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:09:11,089 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:09:11,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-20 11:09:11,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:09:11,295 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:09:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:09:11,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-11-20 11:09:11,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:09:11,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270272483] [2022-11-20 11:09:11,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:09:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:09:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:09:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:09:19,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:09:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270272483] [2022-11-20 11:09:19,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270272483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:09:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719670190] [2022-11-20 11:09:19,539 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:09:19,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:09:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:09:19,540 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:09:19,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 11:09:19,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:09:19,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:09:19,662 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-20 11:09:19,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:09:19,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:09:19,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 11:09:19,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:09:19,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:09:20,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:09:20,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:09:21,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-20 11:09:22,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 45 [2022-11-20 11:09:22,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:22,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:22,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:22,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2022-11-20 11:09:23,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:23,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:23,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:23,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-11-20 11:09:24,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:09:24,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:24,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:24,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:24,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-11-20 11:09:25,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:25,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:25,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:25,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:09:25,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:25,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:25,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2022-11-20 11:09:26,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:26,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:26,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:26,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:26,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:26,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:09:26,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:09:26,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2022-11-20 11:09:27,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 63 [2022-11-20 11:09:27,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 42 [2022-11-20 11:09:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:09:27,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:09:53,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:09:53,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 2288 treesize of output 520 [2022-11-20 11:09:56,760 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (+ 2 .cse4) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse5 .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse9)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse14 .cse15)))))) (+ .cse4 4)) (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse14))))))) is different from false [2022-11-20 11:09:59,902 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse8)))))) (+ 7 .cse9))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ 5 .cse9) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse14 .cse15))))))) (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse14))))))) is different from false [2022-11-20 11:10:03,034 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (+ .cse9 10)) (not (= (select v_arrayElimArr_5 .cse8) 3)) (not (= 3 (select v_arrayElimArr_5 .cse6))) (not (= (select v_arrayElimArr_5 .cse7) 3)) (not (= 3 .cse4))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse8) 3)) (not (= 3 (select v_arrayElimArr_5 .cse6))) (not (= (select v_arrayElimArr_5 .cse7) 3)) (not (= 3 .cse10)) (< (+ .cse9 8) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse11 .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse10 .cse15)))))))))))) is different from false [2022-11-20 11:10:06,097 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse8)))))) (+ .cse9 13))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse10)) (< (+ .cse9 11) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse11 .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse10 .cse15)))))))))))) is different from false [2022-11-20 11:10:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-20 11:10:06,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719670190] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:10:06,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:10:06,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 83 [2022-11-20 11:10:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539218506] [2022-11-20 11:10:06,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:10:06,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-20 11:10:06,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:10:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-20 11:10:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=5424, Unknown=4, NotChecked=628, Total=6806 [2022-11-20 11:10:06,394 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 83 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:10,886 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse11 .cse10)) (.cse0 (select .cse11 .cse9)) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select .cse11 .cse8))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 3) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse7)) .cse10 (+ .cse1 2)) .cse9 (+ .cse0 2)) .cse8 (+ 2 .cse12))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2 .cse5 .cse6 .cse7))))))) (not (= .cse7 1)) (not (= .cse12 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse13 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse10) 3)) (not (= 3 (select v_arrayElimArr_5 .cse8))) (not (= (select v_arrayElimArr_5 .cse9) 3)) (not (= 3 .cse13)) (< (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse14 .cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse13 .cse18)))))) (+ .cse19 13))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse10) 3)) (not (= 3 (select v_arrayElimArr_5 .cse8))) (not (= (select v_arrayElimArr_5 .cse9) 3)) (not (= 3 .cse20)) (< (+ .cse19 11) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse21 .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse20 .cse25)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-11-20 11:10:18,028 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-20 11:10:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:10:18,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2371 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=752, Invalid=5425, Unknown=5, NotChecked=790, Total=6972 [2022-11-20 11:10:18,031 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:10:18,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 20 Unchecked, 1.3s Time] [2022-11-20 11:10:18,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-20 11:10:18,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-20 11:10:18,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 11:10:18,232 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 48 more [2022-11-20 11:10:18,236 INFO L158 Benchmark]: Toolchain (without parser) took 184891.49ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 141.4MB in the beginning and 128.9MB in the end (delta: 12.5MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2022-11-20 11:10:18,237 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 184.5MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:10:18,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.89ms. Allocated memory is still 184.5MB. Free memory was 141.4MB in the beginning and 130.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:10:18,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.66ms. Allocated memory is still 184.5MB. Free memory was 130.8MB in the beginning and 128.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:10:18,237 INFO L158 Benchmark]: Boogie Preprocessor took 26.26ms. Allocated memory is still 184.5MB. Free memory was 128.9MB in the beginning and 127.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:10:18,238 INFO L158 Benchmark]: RCFGBuilder took 440.25ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 114.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 11:10:18,238 INFO L158 Benchmark]: TraceAbstraction took 184107.14ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 114.3MB in the beginning and 128.9MB in the end (delta: -14.6MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2022-11-20 11:10:18,239 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 184.5MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.89ms. Allocated memory is still 184.5MB. Free memory was 141.4MB in the beginning and 130.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.66ms. Allocated memory is still 184.5MB. Free memory was 130.8MB in the beginning and 128.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.26ms. Allocated memory is still 184.5MB. Free memory was 128.9MB in the beginning and 127.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 440.25ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 114.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 184107.14ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 114.3MB in the beginning and 128.9MB in the end (delta: -14.6MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s2lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --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 b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:10:20,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:10:20,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:10:20,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:10:20,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:10:20,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:10:20,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:10:20,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:10:20,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:10:20,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:10:20,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:10:20,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:10:20,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:10:20,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:10:20,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:10:20,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:10:20,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:10:20,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:10:20,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:10:20,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:10:20,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:10:20,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:10:20,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:10:20,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:10:20,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:10:20,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:10:20,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:10:20,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:10:20,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:10:20,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:10:20,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:10:20,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:10:20,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:10:20,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:10:20,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:10:20,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:10:20,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:10:20,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:10:20,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:10:20,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:10:20,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:10:20,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 11:10:20,607 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:10:20,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:10:20,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:10:20,609 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:10:20,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:10:20,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:10:20,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:10:20,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:10:20,612 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:10:20,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:10:20,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:10:20,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:10:20,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:10:20,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:10:20,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:10:20,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:10:20,615 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:10:20,616 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 11:10:20,616 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 11:10:20,616 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:10:20,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:10:20,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:10:20,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:10:20,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:10:20,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:10:20,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:10:20,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:10:20,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:10:20,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:10:20,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:10:20,620 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 11:10:20,620 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 11:10:20,620 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:10:20,621 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:10:20,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:10:20,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 11:10:20,622 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f [2022-11-20 11:10:20,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:10:21,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:10:21,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:10:21,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:10:21,028 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:10:21,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-fpi/s2lif.c [2022-11-20 11:10:24,339 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:10:24,534 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:10:24,534 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/sv-benchmarks/c/array-fpi/s2lif.c [2022-11-20 11:10:24,541 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/data/ee35dafa1/0337b49393cc4b4ba07f725dc43e6d0b/FLAG5a7ed915e [2022-11-20 11:10:24,559 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/data/ee35dafa1/0337b49393cc4b4ba07f725dc43e6d0b [2022-11-20 11:10:24,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:10:24,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:10:24,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:10:24,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:10:24,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:10:24,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ff24e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24, skipping insertion in model container [2022-11-20 11:10:24,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:10:24,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:10:24,764 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-11-20 11:10:24,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:10:24,805 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:10:24,819 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-11-20 11:10:24,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:10:24,848 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:10:24,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24 WrapperNode [2022-11-20 11:10:24,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:10:24,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:10:24,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:10:24,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:10:24,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,890 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-11-20 11:10:24,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:10:24,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:10:24,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:10:24,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:10:24,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:10:24,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:10:24,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:10:24,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:10:24,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (1/1) ... [2022-11-20 11:10:24,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:10:24,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:10:24,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:10:24,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:10:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:10:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 11:10:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:10:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-20 11:10:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:10:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 11:10:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:10:25,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:10:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-20 11:10:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:10:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 11:10:25,151 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:10:25,165 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:10:25,482 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:10:25,491 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:10:25,491 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 11:10:25,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:10:25 BoogieIcfgContainer [2022-11-20 11:10:25,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:10:25,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:10:25,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:10:25,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:10:25,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:10:24" (1/3) ... [2022-11-20 11:10:25,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a38f9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:10:25, skipping insertion in model container [2022-11-20 11:10:25,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:10:24" (2/3) ... [2022-11-20 11:10:25,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a38f9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:10:25, skipping insertion in model container [2022-11-20 11:10:25,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:10:25" (3/3) ... [2022-11-20 11:10:25,503 INFO L112 eAbstractionObserver]: Analyzing ICFG s2lif.c [2022-11-20 11:10:25,519 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:10:25,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:10:25,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:10:25,579 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@185a990c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:10:25,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:10:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:10:25,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:10:25,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:10:25,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:10:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:25,617 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-20 11:10:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:10:25,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941584005] [2022-11-20 11:10:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:10:25,633 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 [2022-11-20 11:10:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:10:25,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:10:25,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:10:25,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 11:10:25,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:10:25,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:10:25,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:10:25,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941584005] [2022-11-20 11:10:25,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941584005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:10:25,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:10:25,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:10:25,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419749747] [2022-11-20 11:10:25,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:10:25,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:10:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:10:25,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:10:25,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:10:25,847 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:10:25,865 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-20 11:10:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:10:25,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:10:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:10:25,874 INFO L225 Difference]: With dead ends: 40 [2022-11-20 11:10:25,874 INFO L226 Difference]: Without dead ends: 18 [2022-11-20 11:10:25,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:10:25,879 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:10:25,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:10:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-20 11:10:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 11:10:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-20 11:10:25,907 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-20 11:10:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:10:25,907 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-20 11:10:25,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-20 11:10:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:10:25,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:10:25,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:10:25,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 11:10:26,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:10:26,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:10:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-20 11:10:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:10:26,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117411999] [2022-11-20 11:10:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:10:26,123 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 [2022-11-20 11:10:26,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:10:26,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:10:26,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:10:26,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:10:26,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:10:26,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:10:26,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:10:26,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117411999] [2022-11-20 11:10:26,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117411999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:10:26,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:10:26,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:10:26,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038392283] [2022-11-20 11:10:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:10:26,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:10:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:10:26,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:10:26,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:10:26,368 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:10:26,550 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-20 11:10:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:10:26,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:10:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:10:26,552 INFO L225 Difference]: With dead ends: 36 [2022-11-20 11:10:26,552 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 11:10:26,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:10:26,554 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:10:26,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:10:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 11:10:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-20 11:10:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-20 11:10:26,562 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-20 11:10:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:10:26,562 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-20 11:10:26,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-20 11:10:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:10:26,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:10:26,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:10:26,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:10:26,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:10:26,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:10:26,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:26,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-20 11:10:26,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:10:26,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491697457] [2022-11-20 11:10:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:10:26,781 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 [2022-11-20 11:10:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:10:26,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:10:26,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:10:26,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 11:10:26,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:27,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:10:27,090 INFO L350 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 18 treesize of output 19 [2022-11-20 11:10:27,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 11:10:27,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:27,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 11:10:27,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:27,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2022-11-20 11:10:27,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:27,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 47 [2022-11-20 11:10:28,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:28,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2022-11-20 11:10:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:10:28,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:10:35,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:10:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:10:35,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:10:35,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491697457] [2022-11-20 11:10:35,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491697457] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:10:35,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:10:35,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-20 11:10:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69220860] [2022-11-20 11:10:35,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:10:35,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 11:10:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:10:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 11:10:35,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=448, Unknown=1, NotChecked=0, Total=552 [2022-11-20 11:10:35,463 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:10:40,757 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-11-20 11:10:40,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:10:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 11:10:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:10:40,761 INFO L225 Difference]: With dead ends: 50 [2022-11-20 11:10:40,761 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:10:40,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=251, Invalid=1008, Unknown=1, NotChecked=0, Total=1260 [2022-11-20 11:10:40,763 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:10:40,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 57 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 261 Invalid, 0 Unknown, 47 Unchecked, 1.9s Time] [2022-11-20 11:10:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:10:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-11-20 11:10:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-20 11:10:40,774 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-11-20 11:10:40,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:10:40,774 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-20 11:10:40,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-20 11:10:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:10:40,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:10:40,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:10:40,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:40,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:10:40,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:10:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-20 11:10:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:10:40,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322890709] [2022-11-20 11:10:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:10:40,990 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 [2022-11-20 11:10:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:10:40,992 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:10:41,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:10:41,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:10:41,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:41,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:10:41,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:10:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:10:41,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:10:41,304 INFO L350 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 14 treesize of output 12 [2022-11-20 11:10:41,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-20 11:10:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:10:41,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:10:41,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322890709] [2022-11-20 11:10:41,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322890709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:10:41,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:10:41,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-20 11:10:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100178717] [2022-11-20 11:10:41,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:10:41,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:10:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:10:41,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:10:41,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:10:41,345 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:10:41,581 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-11-20 11:10:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:10:41,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 11:10:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:10:41,583 INFO L225 Difference]: With dead ends: 49 [2022-11-20 11:10:41,583 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 11:10:41,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:10:41,584 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:10:41,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:10:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 11:10:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-20 11:10:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-20 11:10:41,595 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2022-11-20 11:10:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:10:41,595 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-20 11:10:41,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-20 11:10:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:10:41,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:10:41,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:10:41,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:10:41,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:10:41,809 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:10:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-20 11:10:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:10:41,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713918362] [2022-11-20 11:10:41,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:10:41,810 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 [2022-11-20 11:10:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:10:41,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:10:41,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:41,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:10:41,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:10:41,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:10:41,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:10:42,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:10:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:10:42,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:10:42,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713918362] [2022-11-20 11:10:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713918362] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:10:42,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:10:42,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-11-20 11:10:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091403223] [2022-11-20 11:10:42,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:10:42,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:10:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:10:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:10:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:10:42,391 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:10:43,133 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-11-20 11:10:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:10:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:10:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:10:43,135 INFO L225 Difference]: With dead ends: 63 [2022-11-20 11:10:43,135 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:10:43,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:10:43,136 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:10:43,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 23 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:10:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:10:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2022-11-20 11:10:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 11:10:43,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-20 11:10:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:10:43,147 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 11:10:43,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 11:10:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:10:43,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:10:43,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:10:43,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:43,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:10:43,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:10:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-20 11:10:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:10:43,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368293271] [2022-11-20 11:10:43,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:10:43,351 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 [2022-11-20 11:10:43,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:10:43,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:10:43,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:43,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:10:43,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:10:43,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:10:43,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:10:43,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:10:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:10:44,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:10:44,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368293271] [2022-11-20 11:10:44,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368293271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:10:44,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:10:44,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-11-20 11:10:44,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97137408] [2022-11-20 11:10:44,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:10:44,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:10:44,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:10:44,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:10:44,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:10:44,160 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:10:45,251 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-11-20 11:10:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:10:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:10:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:10:45,253 INFO L225 Difference]: With dead ends: 72 [2022-11-20 11:10:45,253 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 11:10:45,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-11-20 11:10:45,254 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 217 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:10:45,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 23 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:10:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 11:10:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-11-20 11:10:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-11-20 11:10:45,267 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 22 [2022-11-20 11:10:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:10:45,267 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-11-20 11:10:45,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:10:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-11-20 11:10:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:10:45,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:10:45,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:10:45,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:45,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:10:45,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:10:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-20 11:10:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:10:45,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974297265] [2022-11-20 11:10:45,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:10:45,480 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 [2022-11-20 11:10:45,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:10:45,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:10:45,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:10:45,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:10:45,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:10:45,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-20 11:10:45,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:45,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:10:45,745 INFO L350 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 18 treesize of output 19 [2022-11-20 11:10:45,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 11:10:45,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 11:10:45,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 11:10:46,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:46,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 11:10:46,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:46,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2022-11-20 11:10:47,205 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 11:10:47,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 70 [2022-11-20 11:10:47,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:47,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 73 [2022-11-20 11:10:48,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:48,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 83 [2022-11-20 11:10:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:10:48,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:11:32,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:11:32,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 653 treesize of output 289 [2022-11-20 11:11:40,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:11:40,908 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 11:11:40,908 INFO L350 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 562 treesize of output 1 [2022-11-20 11:11:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:11:40,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:11:40,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974297265] [2022-11-20 11:11:40,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974297265] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:11:40,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:11:40,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2022-11-20 11:11:40,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629416821] [2022-11-20 11:11:40,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:11:40,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 11:11:40,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:11:40,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 11:11:40,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1059, Unknown=17, NotChecked=0, Total=1260 [2022-11-20 11:11:40,913 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:09,344 WARN L233 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 74 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:12:32,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:12:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:12:44,280 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-11-20 11:12:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 11:12:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:12:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:12:44,281 INFO L225 Difference]: With dead ends: 62 [2022-11-20 11:12:44,282 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 11:12:44,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 110.0s TimeCoverageRelationStatistics Valid=459, Invalid=2586, Unknown=35, NotChecked=0, Total=3080 [2022-11-20 11:12:44,284 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:12:44,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 60 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 338 Invalid, 1 Unknown, 223 Unchecked, 5.9s Time] [2022-11-20 11:12:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 11:12:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-11-20 11:12:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-20 11:12:44,295 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2022-11-20 11:12:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:12:44,295 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-20 11:12:44,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-20 11:12:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:12:44,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:12:44,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:12:44,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:12:44,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:12:44,509 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:12:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:12:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-20 11:12:44,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:12:44,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643510994] [2022-11-20 11:12:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:12:44,510 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 [2022-11-20 11:12:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:12:44,514 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:12:44,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:12:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:12:44,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:12:44,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:12:44,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:12:44,883 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 11:12:44,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 11:12:44,961 INFO L350 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 19 treesize of output 7 [2022-11-20 11:12:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:12:44,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:12:45,173 INFO L350 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 16 treesize of output 14 [2022-11-20 11:12:45,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 16 [2022-11-20 11:12:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:12:45,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:12:45,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643510994] [2022-11-20 11:12:45,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643510994] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:12:45,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:12:45,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-11-20 11:12:45,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044759001] [2022-11-20 11:12:45,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:12:45,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:12:45,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:12:45,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:12:45,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:12:45,296 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:12:46,171 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-20 11:12:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:12:46,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:12:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:12:46,173 INFO L225 Difference]: With dead ends: 69 [2022-11-20 11:12:46,173 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:12:46,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:12:46,174 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:12:46,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:12:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:12:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-20 11:12:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-20 11:12:46,184 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2022-11-20 11:12:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:12:46,184 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-20 11:12:46,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-20 11:12:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:12:46,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:12:46,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:12:46,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:12:46,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:12:46,398 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:12:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:12:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 5 times [2022-11-20 11:12:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:12:46,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202322498] [2022-11-20 11:12:46,399 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:12:46,399 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 [2022-11-20 11:12:46,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:12:46,400 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:12:46,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:12:46,514 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 11:12:46,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:12:46,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:12:46,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:12:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:12:47,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:12:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:12:48,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:12:48,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202322498] [2022-11-20 11:12:48,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202322498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:12:48,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:12:48,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-11-20 11:12:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132429694] [2022-11-20 11:12:48,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:12:48,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 11:12:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:12:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 11:12:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-11-20 11:12:48,649 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:12:52,044 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-11-20 11:12:52,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:12:52,045 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 11:12:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:12:52,046 INFO L225 Difference]: With dead ends: 88 [2022-11-20 11:12:52,046 INFO L226 Difference]: Without dead ends: 69 [2022-11-20 11:12:52,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 11:12:52,047 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 392 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:12:52,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 25 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 11:12:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-20 11:12:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-11-20 11:12:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-20 11:12:52,067 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2022-11-20 11:12:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:12:52,067 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-20 11:12:52,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:12:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-20 11:12:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:12:52,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:12:52,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:12:52,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:12:52,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:12:52,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:12:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:12:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 6 times [2022-11-20 11:12:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:12:52,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863152377] [2022-11-20 11:12:52,286 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:12:52,286 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 [2022-11-20 11:12:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:12:52,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 11:12:52,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c45bd12-8111-4dfc-bfd3-8e93936d8423/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 11:12:52,467 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-20 11:12:52,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:12:52,475 WARN L261 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 11:12:52,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:12:52,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:12:52,655 INFO L350 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 18 treesize of output 19 [2022-11-20 11:12:52,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 11:12:52,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 11:12:53,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 11:12:53,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 11:12:54,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:12:54,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 11:12:54,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:12:54,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2022-11-20 11:12:55,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:12:55,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 61 [2022-11-20 11:12:56,459 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-20 11:12:56,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 82 [2022-11-20 11:12:59,095 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-20 11:12:59,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 96 [2022-11-20 11:13:00,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:13:00,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 174 treesize of output 113 [2022-11-20 11:13:01,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:13:01,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 142 [2022-11-20 11:13:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:13:01,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:15:26,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:15:26,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 3961 treesize of output 1239 [2022-11-20 11:15:56,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:15:56,709 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 11:15:56,711 INFO L350 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 2506 treesize of output 1 [2022-11-20 11:15:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:15:56,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:15:56,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863152377] [2022-11-20 11:15:56,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863152377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:15:56,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:15:56,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2022-11-20 11:15:56,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586468048] [2022-11-20 11:15:56,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:15:56,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 11:15:56,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:15:56,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 11:15:56,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1820, Unknown=32, NotChecked=0, Total=2162 [2022-11-20 11:15:56,718 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:16:09,894 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse78 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse77 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse78)) (.cse74 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse75 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse78))) (let ((.cse61 (select .cse74 .cse75)) (.cse72 (select .cse74 .cse77))) (let ((.cse22 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse78)) (.cse57 (store .cse74 .cse77 (bvadd (_ bv2 32) .cse72))) (.cse76 (bvadd (_ bv2 32) .cse61))) (let ((.cse24 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse13 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse15 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (store .cse57 .cse75 .cse76)) (.cse73 (select .cse74 .cse22))) (let ((.cse2 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse35 (store .cse74 .cse75 .cse76)) (.cse23 (bvadd (_ bv2 32) .cse73)) (.cse5 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse6 (not (= .cse73 (_ bv1 32)))) (.cse0 (bvule c_~N~0 (_ bv536870911 32))) (.cse58 (not (= .cse72 (_ bv1 32)))) (.cse1 (= .cse24 (let ((.cse62 (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (let ((.cse70 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse71 (bvadd ((_ sign_extend 32) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse70 .cse12) (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse69 ((_ extract 31 0) .cse71)) (.cse68 ((_ extract 63 32) .cse71))) (let ((.cse66 (store (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse69) .cse12 .cse68))) (let ((.cse67 (bvadd ((_ sign_extend 32) (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse66) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse68 .cse69)))) (let ((.cse64 ((_ extract 31 0) .cse67)) (.cse63 ((_ extract 63 32) .cse67))) (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse12 .cse63)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))))) (.cse59 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse3 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse4 (not (= .cse61 (_ bv1 32)))) (.cse60 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (or .cse1 .cse2 .cse3 .cse4) (not (bvslt (_ bv3 32) c_~N~0)) (or .cse5 .cse2 .cse6 (= (let ((.cse7 (let ((.cse20 (store .cse21 .cse22 .cse23))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20))) (let ((.cse18 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (bvadd (concat (select .cse18 .cse12) (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse17 ((_ extract 31 0) .cse19)) (.cse16 ((_ extract 63 32) .cse19))) (let ((.cse11 (store (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17) .cse12 .cse16))) (let ((.cse14 (bvadd ((_ sign_extend 32) (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse16 .cse17)))) (let ((.cse9 ((_ extract 31 0) .cse14)) (.cse8 ((_ extract 63 32) .cse14))) (bvadd (concat .cse8 .cse9) ((_ sign_extend 32) (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse9) .cse12 .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))))))))))))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) .cse24) .cse3 .cse4) (or (= .cse24 (let ((.cse25 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35))) (let ((.cse33 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse12) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse12 .cse31))) (let ((.cse30 (bvadd ((_ sign_extend 32) (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse31 .cse32)))) (let ((.cse27 ((_ extract 31 0) .cse30)) (.cse26 ((_ extract 63 32) .cse30))) (bvadd (concat .cse26 .cse27) ((_ sign_extend 32) (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27) .cse12 .cse26)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25)))) .cse3 .cse4) (not (bvsle c_~N~0 (_ bv0 32))) (or (= .cse24 (let ((.cse36 (let ((.cse46 (store .cse35 .cse22 .cse23))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse44 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (bvadd (concat (select .cse44 .cse12) (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse43 ((_ extract 31 0) .cse45)) (.cse42 ((_ extract 63 32) .cse45))) (let ((.cse38 (store (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43) .cse12 .cse42))) (let ((.cse41 (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse42 .cse43)))) (let ((.cse40 ((_ extract 63 32) .cse41)) (.cse39 ((_ extract 31 0) .cse41))) (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse39) .cse12 .cse40)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (concat .cse40 .cse39)))))))))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36)))) .cse5 .cse6 .cse3 .cse4) (or (= .cse24 (let ((.cse47 (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse57))) (let ((.cse55 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (bvadd (concat (select .cse55 .cse12) (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse54 ((_ extract 31 0) .cse56)) (.cse53 ((_ extract 63 32) .cse56))) (let ((.cse51 (store (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse54) .cse12 .cse53))) (let ((.cse52 (bvadd ((_ sign_extend 32) (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse51) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse53 .cse54)))) (let ((.cse49 ((_ extract 31 0) .cse52)) (.cse48 ((_ extract 63 32) .cse52))) (bvadd (concat .cse48 .cse49) ((_ sign_extend 32) (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse49) .cse12 .cse48)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47)))) .cse58 .cse59) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) (_ bv0 64)) (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) .cse0 (or .cse58 .cse1 .cse59 .cse3 .cse4) (= (select .cse60 .cse12) ((_ extract 63 32) (_ bv0 64)))))))))) is different from true [2022-11-20 11:17:10,643 WARN L233 SmtUtils]: Spent 28.63s on a formula simplification. DAG size of input: 115 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:17:13,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:17:14,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:17:16,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:17:17,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:17:19,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:17:22,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:17:39,878 WARN L233 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 130 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:17:42,079 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse76 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse75 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse76)) (.cse72 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse73 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse76))) (let ((.cse59 (select .cse72 .cse73)) (.cse70 (select .cse72 .cse75))) (let ((.cse21 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse76)) (.cse56 (store .cse72 .cse75 (bvadd (_ bv2 32) .cse70))) (.cse74 (bvadd (_ bv2 32) .cse59))) (let ((.cse23 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse14 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse11 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (store .cse56 .cse73 .cse74)) (.cse71 (select .cse72 .cse21))) (let ((.cse1 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse34 (store .cse72 .cse73 .cse74)) (.cse22 (bvadd (_ bv2 32) .cse71)) (.cse4 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse5 (not (= .cse71 (_ bv1 32)))) (.cse57 (not (= .cse70 (_ bv1 32)))) (.cse0 (= .cse23 (let ((.cse60 (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20))) (let ((.cse68 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (bvadd ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse68 .cse11) (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse67 ((_ extract 31 0) .cse69)) (.cse66 ((_ extract 63 32) .cse69))) (let ((.cse64 (store (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse67) .cse11 .cse66))) (let ((.cse65 (bvadd ((_ sign_extend 32) (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse66 .cse67)))) (let ((.cse62 ((_ extract 31 0) .cse65)) (.cse61 ((_ extract 63 32) .cse65))) (bvadd (concat .cse61 .cse62) ((_ sign_extend 32) (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse62) .cse11 .cse61)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))))) (.cse58 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse2 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse3 (not (= .cse59 (_ bv1 32))))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse1 .cse5 (= (let ((.cse6 (let ((.cse19 (store .cse20 .cse21 .cse22))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19))) (let ((.cse17 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (bvadd (concat (select .cse17 .cse11) (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse16 ((_ extract 31 0) .cse18)) (.cse15 ((_ extract 63 32) .cse18))) (let ((.cse10 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse16) .cse11 .cse15))) (let ((.cse13 (bvadd ((_ sign_extend 32) (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse15 .cse16)))) (let ((.cse8 ((_ extract 31 0) .cse13)) (.cse7 ((_ extract 63 32) .cse13))) (bvadd (concat .cse7 .cse8) ((_ sign_extend 32) (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8) .cse11 .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))))))))))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))) .cse23) .cse2 .cse3) (or (= .cse23 (let ((.cse24 (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34))) (let ((.cse32 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (bvadd (concat (select .cse32 .cse11) (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse31 ((_ extract 31 0) .cse33)) (.cse30 ((_ extract 63 32) .cse33))) (let ((.cse28 (store (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse11 .cse30))) (let ((.cse29 (bvadd ((_ sign_extend 32) (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse30 .cse31)))) (let ((.cse26 ((_ extract 31 0) .cse29)) (.cse25 ((_ extract 63 32) .cse29))) (bvadd (concat .cse25 .cse26) ((_ sign_extend 32) (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse26) .cse11 .cse25)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))) .cse2 .cse3) (not (bvsle c_~N~0 (_ bv0 32))) (or (= .cse23 (let ((.cse35 (let ((.cse45 (store .cse34 .cse21 .cse22))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse43 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (bvadd (concat (select .cse43 .cse11) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse44)) (.cse41 ((_ extract 63 32) .cse44))) (let ((.cse37 (store (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42) .cse11 .cse41))) (let ((.cse40 (bvadd ((_ sign_extend 32) (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse37) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse41 .cse42)))) (let ((.cse39 ((_ extract 63 32) .cse40)) (.cse38 ((_ extract 31 0) .cse40))) (bvadd ((_ sign_extend 32) (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse38) .cse11 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (concat .cse39 .cse38)))))))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35)))) .cse4 .cse5 .cse2 .cse3) (or (= .cse23 (let ((.cse46 (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse54 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (bvadd (concat (select .cse54 .cse11) (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse53 ((_ extract 31 0) .cse55)) (.cse52 ((_ extract 63 32) .cse55))) (let ((.cse50 (store (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse53) .cse11 .cse52))) (let ((.cse51 (bvadd ((_ sign_extend 32) (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse50) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse52 .cse53)))) (let ((.cse48 ((_ extract 31 0) .cse51)) (.cse47 ((_ extract 63 32) .cse51))) (bvadd (concat .cse47 .cse48) ((_ sign_extend 32) (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse48) .cse11 .cse47)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46)))) .cse57 .cse58) (bvule c_~N~0 (_ bv536870911 32)) (or .cse57 .cse0 .cse58 .cse2 .cse3)))))))) is different from false [2022-11-20 11:17:44,093 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse76 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse75 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse76)) (.cse72 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse73 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse76))) (let ((.cse59 (select .cse72 .cse73)) (.cse70 (select .cse72 .cse75))) (let ((.cse21 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse76)) (.cse56 (store .cse72 .cse75 (bvadd (_ bv2 32) .cse70))) (.cse74 (bvadd (_ bv2 32) .cse59))) (let ((.cse23 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse14 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse11 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (store .cse56 .cse73 .cse74)) (.cse71 (select .cse72 .cse21))) (let ((.cse1 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse34 (store .cse72 .cse73 .cse74)) (.cse22 (bvadd (_ bv2 32) .cse71)) (.cse4 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse5 (not (= .cse71 (_ bv1 32)))) (.cse57 (not (= .cse70 (_ bv1 32)))) (.cse0 (= .cse23 (let ((.cse60 (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20))) (let ((.cse68 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (bvadd ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse68 .cse11) (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse67 ((_ extract 31 0) .cse69)) (.cse66 ((_ extract 63 32) .cse69))) (let ((.cse64 (store (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse67) .cse11 .cse66))) (let ((.cse65 (bvadd ((_ sign_extend 32) (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse66 .cse67)))) (let ((.cse62 ((_ extract 31 0) .cse65)) (.cse61 ((_ extract 63 32) .cse65))) (bvadd (concat .cse61 .cse62) ((_ sign_extend 32) (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse62) .cse11 .cse61)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))))) (.cse58 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse2 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse3 (not (= .cse59 (_ bv1 32))))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse1 .cse5 (= (let ((.cse6 (let ((.cse19 (store .cse20 .cse21 .cse22))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19))) (let ((.cse17 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (bvadd (concat (select .cse17 .cse11) (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse16 ((_ extract 31 0) .cse18)) (.cse15 ((_ extract 63 32) .cse18))) (let ((.cse10 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse16) .cse11 .cse15))) (let ((.cse13 (bvadd ((_ sign_extend 32) (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse15 .cse16)))) (let ((.cse8 ((_ extract 31 0) .cse13)) (.cse7 ((_ extract 63 32) .cse13))) (bvadd (concat .cse7 .cse8) ((_ sign_extend 32) (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8) .cse11 .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))))))))))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))) .cse23) .cse2 .cse3) (or (= .cse23 (let ((.cse24 (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34))) (let ((.cse32 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (bvadd (concat (select .cse32 .cse11) (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse31 ((_ extract 31 0) .cse33)) (.cse30 ((_ extract 63 32) .cse33))) (let ((.cse28 (store (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse11 .cse30))) (let ((.cse29 (bvadd ((_ sign_extend 32) (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse30 .cse31)))) (let ((.cse26 ((_ extract 31 0) .cse29)) (.cse25 ((_ extract 63 32) .cse29))) (bvadd (concat .cse25 .cse26) ((_ sign_extend 32) (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse26) .cse11 .cse25)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))) .cse2 .cse3) (not (bvsle c_~N~0 (_ bv0 32))) (or (= .cse23 (let ((.cse35 (let ((.cse45 (store .cse34 .cse21 .cse22))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse43 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (bvadd (concat (select .cse43 .cse11) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse44)) (.cse41 ((_ extract 63 32) .cse44))) (let ((.cse37 (store (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42) .cse11 .cse41))) (let ((.cse40 (bvadd ((_ sign_extend 32) (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse37) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse41 .cse42)))) (let ((.cse39 ((_ extract 63 32) .cse40)) (.cse38 ((_ extract 31 0) .cse40))) (bvadd ((_ sign_extend 32) (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse38) .cse11 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (concat .cse39 .cse38)))))))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35)))) .cse4 .cse5 .cse2 .cse3) (or (= .cse23 (let ((.cse46 (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse54 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (bvadd (concat (select .cse54 .cse11) (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse53 ((_ extract 31 0) .cse55)) (.cse52 ((_ extract 63 32) .cse55))) (let ((.cse50 (store (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse53) .cse11 .cse52))) (let ((.cse51 (bvadd ((_ sign_extend 32) (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse50) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse52 .cse53)))) (let ((.cse48 ((_ extract 31 0) .cse51)) (.cse47 ((_ extract 63 32) .cse51))) (bvadd (concat .cse47 .cse48) ((_ sign_extend 32) (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse48) .cse11 .cse47)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46)))) .cse57 .cse58) (bvule c_~N~0 (_ bv536870911 32)) (or .cse57 .cse0 .cse58 .cse2 .cse3)))))))) is different from true [2022-11-20 11:18:25,153 WARN L233 SmtUtils]: Spent 14.63s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:18:30,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:18:32,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:18:33,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:18:35,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:18:37,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:19:02,118 WARN L233 SmtUtils]: Spent 16.82s on a formula simplification. DAG size of input: 116 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:19:05,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:19:07,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:19:09,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:19:12,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:19:14,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:19:17,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:19:20,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []