./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/eureka_01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/eureka_01-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa --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 a7ef5e9072271cbf0486c6be0aa2bd26b235c6b4341d8940adfe18a5a48a6524 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:43:14,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:43:14,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:43:14,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:43:14,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:43:14,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:43:14,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:43:14,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:43:14,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:43:14,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:43:14,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:43:14,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:43:14,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:43:14,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:43:14,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:43:14,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:43:14,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:43:14,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:43:14,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:43:14,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:43:14,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:43:14,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:43:14,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:43:14,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:43:14,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:43:14,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:43:14,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:43:14,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:43:14,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:43:14,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:43:14,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:43:14,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:43:14,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:43:14,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:43:14,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:43:14,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:43:14,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:43:14,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:43:14,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:43:14,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:43:14,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:43:14,552 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 01:43:14,570 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:43:14,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:43:14,571 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:43:14,571 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:43:14,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:43:14,571 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:43:14,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:43:14,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:43:14,572 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:43:14,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:43:14,572 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:43:14,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:43:14,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:43:14,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:43:14,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:43:14,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:43:14,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:43:14,573 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:43:14,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:43:14,574 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:43:14,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:43:14,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:43:14,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:43:14,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:43:14,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:43:14,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:43:14,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:43:14,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:43:14,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:43:14,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:43:14,575 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:43:14,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:43:14,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:43:14,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:43:14,575 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_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/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_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa 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 -> a7ef5e9072271cbf0486c6be0aa2bd26b235c6b4341d8940adfe18a5a48a6524 [2021-12-07 01:43:14,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:43:14,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:43:14,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:43:14,786 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:43:14,786 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:43:14,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/loops/eureka_01-1.c [2021-12-07 01:43:14,829 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/data/12bffa159/7e79d6eeb3714803a3f19ad6174a51d2/FLAG6f80691b8 [2021-12-07 01:43:15,218 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:43:15,219 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/sv-benchmarks/c/loops/eureka_01-1.c [2021-12-07 01:43:15,223 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/data/12bffa159/7e79d6eeb3714803a3f19ad6174a51d2/FLAG6f80691b8 [2021-12-07 01:43:15,233 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/data/12bffa159/7e79d6eeb3714803a3f19ad6174a51d2 [2021-12-07 01:43:15,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:43:15,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:43:15,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:43:15,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:43:15,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:43:15,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b54defb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15, skipping insertion in model container [2021-12-07 01:43:15,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:43:15,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:43:15,380 WARN L230 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_396e5f93-d230-4211-8927-b3a10c023e3a/sv-benchmarks/c/loops/eureka_01-1.c[446,459] [2021-12-07 01:43:15,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:43:15,413 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:43:15,423 WARN L230 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_396e5f93-d230-4211-8927-b3a10c023e3a/sv-benchmarks/c/loops/eureka_01-1.c[446,459] [2021-12-07 01:43:15,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:43:15,461 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:43:15,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15 WrapperNode [2021-12-07 01:43:15,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:43:15,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:43:15,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:43:15,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:43:15,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,497 INFO L137 Inliner]: procedures = 15, calls = 98, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2021-12-07 01:43:15,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:43:15,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:43:15,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:43:15,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:43:15,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:43:15,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:43:15,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:43:15,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:43:15,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (1/1) ... [2021-12-07 01:43:15,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:43:15,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:15,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:43:15,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:43:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:43:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:43:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 01:43:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 01:43:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:43:15,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:43:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-07 01:43:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 01:43:15,639 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:43:15,640 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:43:15,785 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:43:15,791 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:43:15,791 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-07 01:43:15,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:15 BoogieIcfgContainer [2021-12-07 01:43:15,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:43:15,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:43:15,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:43:15,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:43:15,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:43:15" (1/3) ... [2021-12-07 01:43:15,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b319572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:43:15, skipping insertion in model container [2021-12-07 01:43:15,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:15" (2/3) ... [2021-12-07 01:43:15,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b319572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:43:15, skipping insertion in model container [2021-12-07 01:43:15,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:15" (3/3) ... [2021-12-07 01:43:15,801 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2021-12-07 01:43:15,805 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:43:15,805 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:43:15,841 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:43:15,847 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:43:15,848 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:43:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 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) [2021-12-07 01:43:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-07 01:43:15,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:15,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:15,864 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2021-12-07 01:43:15,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:15,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612081506] [2021-12-07 01:43:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:15,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:16,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:16,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612081506] [2021-12-07 01:43:16,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612081506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:16,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:16,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:43:16,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537271132] [2021-12-07 01:43:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:16,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:43:16,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:43:16,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:43:16,096 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 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) 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) [2021-12-07 01:43:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:16,174 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2021-12-07 01:43:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:43:16,176 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 [2021-12-07 01:43:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:16,182 INFO L225 Difference]: With dead ends: 89 [2021-12-07 01:43:16,182 INFO L226 Difference]: Without dead ends: 42 [2021-12-07 01:43:16,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:43:16,187 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:16,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-07 01:43:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2021-12-07 01:43:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 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) [2021-12-07 01:43:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-07 01:43:16,211 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2021-12-07 01:43:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:16,212 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-07 01:43:16,212 INFO L471 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) [2021-12-07 01:43:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-07 01:43:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:43:16,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:16,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:16,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:43:16,213 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:16,214 INFO L85 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2021-12-07 01:43:16,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:16,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867824425] [2021-12-07 01:43:16,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:16,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:16,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:16,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867824425] [2021-12-07 01:43:16,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867824425] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623638376] [2021-12-07 01:43:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:16,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:16,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:16,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:16,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:43:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:16,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-07 01:43:16,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:16,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:16,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:16,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:16,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:16,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 24 [2021-12-07 01:43:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:16,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623638376] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:16,731 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:16,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-12-07 01:43:16,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126458515] [2021-12-07 01:43:16,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:16,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:43:16,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:16,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:43:16,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:43:16,734 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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) [2021-12-07 01:43:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:16,900 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2021-12-07 01:43:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:43:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 19 [2021-12-07 01:43:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:16,902 INFO L225 Difference]: With dead ends: 84 [2021-12-07 01:43:16,902 INFO L226 Difference]: Without dead ends: 82 [2021-12-07 01:43:16,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:43:16,905 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 75 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:16,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 145 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-07 01:43:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2021-12-07 01:43:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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) [2021-12-07 01:43:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2021-12-07 01:43:16,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2021-12-07 01:43:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:16,913 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2021-12-07 01:43:16,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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) [2021-12-07 01:43:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2021-12-07 01:43:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:43:16,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:16,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:16,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:43:17,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:17,117 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2021-12-07 01:43:17,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:17,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907693948] [2021-12-07 01:43:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:17,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:17,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:17,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907693948] [2021-12-07 01:43:17,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907693948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:17,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:17,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:43:17,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862242352] [2021-12-07 01:43:17,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:17,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:43:17,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:17,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:43:17,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:43:17,177 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-12-07 01:43:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:17,205 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2021-12-07 01:43:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:43:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2021-12-07 01:43:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:17,207 INFO L225 Difference]: With dead ends: 66 [2021-12-07 01:43:17,207 INFO L226 Difference]: Without dead ends: 45 [2021-12-07 01:43:17,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:43:17,209 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:17,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:43:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-07 01:43:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-12-07 01:43:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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) [2021-12-07 01:43:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2021-12-07 01:43:17,218 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2021-12-07 01:43:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:17,218 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2021-12-07 01:43:17,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-12-07 01:43:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2021-12-07 01:43:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-07 01:43:17,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:17,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:17,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:43:17,220 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2021-12-07 01:43:17,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:17,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517195746] [2021-12-07 01:43:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:17,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:17,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:17,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517195746] [2021-12-07 01:43:17,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517195746] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:17,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399471211] [2021-12-07 01:43:17,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:17,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:17,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:17,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:43:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:17,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 01:43:17,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:17,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:17,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399471211] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:17,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:17,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-07 01:43:17,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406742131] [2021-12-07 01:43:17,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:17,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:43:17,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:17,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:43:17,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:43:17,409 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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) [2021-12-07 01:43:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:17,493 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2021-12-07 01:43:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:43:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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 22 [2021-12-07 01:43:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:17,494 INFO L225 Difference]: With dead ends: 114 [2021-12-07 01:43:17,494 INFO L226 Difference]: Without dead ends: 86 [2021-12-07 01:43:17,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:43:17,496 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:17,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 141 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-07 01:43:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2021-12-07 01:43:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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) [2021-12-07 01:43:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2021-12-07 01:43:17,503 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2021-12-07 01:43:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:17,504 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2021-12-07 01:43:17,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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) [2021-12-07 01:43:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2021-12-07 01:43:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-07 01:43:17,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:17,505 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:17,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:43:17,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:17,707 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2021-12-07 01:43:17,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:17,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765137596] [2021-12-07 01:43:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:17,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:17,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:17,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765137596] [2021-12-07 01:43:17,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765137596] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:17,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174274550] [2021-12-07 01:43:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:17,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:17,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:17,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:17,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 01:43:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:17,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 01:43:17,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:17,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:17,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174274550] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:17,946 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:17,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-07 01:43:17,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144540560] [2021-12-07 01:43:17,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:17,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:43:17,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:17,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:43:17,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:43:17,948 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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) [2021-12-07 01:43:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:18,075 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2021-12-07 01:43:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:43:18,075 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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 [2021-12-07 01:43:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:18,076 INFO L225 Difference]: With dead ends: 181 [2021-12-07 01:43:18,077 INFO L226 Difference]: Without dead ends: 159 [2021-12-07 01:43:18,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:43:18,078 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 164 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:18,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 155 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-07 01:43:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2021-12-07 01:43:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 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) [2021-12-07 01:43:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2021-12-07 01:43:18,087 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2021-12-07 01:43:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:18,087 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2021-12-07 01:43:18,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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) [2021-12-07 01:43:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2021-12-07 01:43:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-07 01:43:18,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:18,088 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:18,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 01:43:18,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:18,290 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:18,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2021-12-07 01:43:18,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:18,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940706407] [2021-12-07 01:43:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:18,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:18,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:18,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940706407] [2021-12-07 01:43:18,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940706407] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:18,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972204665] [2021-12-07 01:43:18,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:18,448 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:18,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:18,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:18,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 01:43:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:18,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 01:43:18,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:18,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:18,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972204665] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:18,646 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:18,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-07 01:43:18,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690333108] [2021-12-07 01:43:18,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:18,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:43:18,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:18,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:43:18,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:43:18,648 INFO L87 Difference]: Start difference. First operand 75 states and 98 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) [2021-12-07 01:43:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:18,733 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2021-12-07 01:43:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:43:18,734 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 23 [2021-12-07 01:43:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:18,735 INFO L225 Difference]: With dead ends: 206 [2021-12-07 01:43:18,735 INFO L226 Difference]: Without dead ends: 146 [2021-12-07 01:43:18,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:43:18,736 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:18,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 101 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-07 01:43:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2021-12-07 01:43:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 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) [2021-12-07 01:43:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2021-12-07 01:43:18,745 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2021-12-07 01:43:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:18,746 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2021-12-07 01:43:18,746 INFO L471 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) [2021-12-07 01:43:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2021-12-07 01:43:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:43:18,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:18,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:18,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-07 01:43:18,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:18,948 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:18,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2021-12-07 01:43:18,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:18,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333091663] [2021-12-07 01:43:18,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:18,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:19,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:19,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333091663] [2021-12-07 01:43:19,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333091663] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:19,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50688888] [2021-12-07 01:43:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:19,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:19,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:19,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:19,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 01:43:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:19,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-07 01:43:19,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:19,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 50 [2021-12-07 01:43:19,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-12-07 01:43:19,581 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-07 01:43:19,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 35 [2021-12-07 01:43:19,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-07 01:43:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:19,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:21,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (forall ((v_ArrVal_210 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-07 01:43:22,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) is different from false [2021-12-07 01:43:23,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int) (v_ArrVal_208 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_208))) (or (< v_ArrVal_208 0) (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-07 01:43:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-12-07 01:43:23,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50688888] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:23,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:23,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2021-12-07 01:43:23,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697677281] [2021-12-07 01:43:23,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:23,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-07 01:43:23,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-07 01:43:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=338, Unknown=3, NotChecked=120, Total=552 [2021-12-07 01:43:23,411 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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) [2021-12-07 01:43:23,817 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-07 01:43:24,200 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-07 01:43:26,209 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (forall ((v_ArrVal_210 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1)) is different from false [2021-12-07 01:43:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:26,296 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2021-12-07 01:43:26,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:43:26,296 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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) Word has length 25 [2021-12-07 01:43:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:26,297 INFO L225 Difference]: With dead ends: 112 [2021-12-07 01:43:26,297 INFO L226 Difference]: Without dead ends: 100 [2021-12-07 01:43:26,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=134, Invalid=484, Unknown=6, NotChecked=306, Total=930 [2021-12-07 01:43:26,298 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:26,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 211 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 104 Unchecked, 0.0s Time] [2021-12-07 01:43:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-07 01:43:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2021-12-07 01:43:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 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) [2021-12-07 01:43:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2021-12-07 01:43:26,311 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 25 [2021-12-07 01:43:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:26,311 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2021-12-07 01:43:26,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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) [2021-12-07 01:43:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2021-12-07 01:43:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:43:26,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:26,313 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:26,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 01:43:26,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-07 01:43:26,514 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2021-12-07 01:43:26,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:26,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39891055] [2021-12-07 01:43:26,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:26,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:26,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:26,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39891055] [2021-12-07 01:43:26,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39891055] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:26,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600079439] [2021-12-07 01:43:26,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:43:26,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:26,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:26,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:26,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 01:43:26,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:43:26,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:43:26,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-07 01:43:26,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:26,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:26,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:26,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 29 [2021-12-07 01:43:26,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:26,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:28,928 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_66| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_250 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_66| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_250) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-07 01:43:28,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 19 [2021-12-07 01:43:28,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 66 [2021-12-07 01:43:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2021-12-07 01:43:28,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600079439] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:28,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:28,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2021-12-07 01:43:28,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928705170] [2021-12-07 01:43:28,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:28,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 01:43:28,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:28,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 01:43:28,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2021-12-07 01:43:28,977 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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) [2021-12-07 01:43:30,996 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_66| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_250 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_66| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_250) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))))) is different from false [2021-12-07 01:43:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:31,140 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2021-12-07 01:43:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:43:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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 25 [2021-12-07 01:43:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:31,142 INFO L225 Difference]: With dead ends: 145 [2021-12-07 01:43:31,142 INFO L226 Difference]: Without dead ends: 143 [2021-12-07 01:43:31,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=113, Invalid=313, Unknown=2, NotChecked=78, Total=506 [2021-12-07 01:43:31,143 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:31,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 153 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 200 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2021-12-07 01:43:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-07 01:43:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2021-12-07 01:43:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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) [2021-12-07 01:43:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2021-12-07 01:43:31,152 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 25 [2021-12-07 01:43:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:31,152 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2021-12-07 01:43:31,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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) [2021-12-07 01:43:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2021-12-07 01:43:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:43:31,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:31,153 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:31,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-07 01:43:31,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:31,354 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2021-12-07 01:43:31,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:31,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381357173] [2021-12-07 01:43:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:31,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:31,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:31,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381357173] [2021-12-07 01:43:31,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381357173] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:31,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813357361] [2021-12-07 01:43:31,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:43:31,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:31,414 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:31,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 01:43:31,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:43:31,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:43:31,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 01:43:31,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:31,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:31,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813357361] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:31,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:31,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-07 01:43:31,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005960038] [2021-12-07 01:43:31,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:31,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:43:31,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:31,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:43:31,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:43:31,547 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) [2021-12-07 01:43:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:31,668 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2021-12-07 01:43:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:43:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) Word has length 28 [2021-12-07 01:43:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:31,670 INFO L225 Difference]: With dead ends: 183 [2021-12-07 01:43:31,670 INFO L226 Difference]: Without dead ends: 170 [2021-12-07 01:43:31,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:43:31,671 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 104 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:31,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 178 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-07 01:43:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2021-12-07 01:43:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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) [2021-12-07 01:43:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2021-12-07 01:43:31,685 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 28 [2021-12-07 01:43:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:31,685 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2021-12-07 01:43:31,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) [2021-12-07 01:43:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2021-12-07 01:43:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-07 01:43:31,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:31,687 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:31,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 01:43:31,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:31,888 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 160714710, now seen corresponding path program 2 times [2021-12-07 01:43:31,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:31,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251546139] [2021-12-07 01:43:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:31,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-07 01:43:31,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:31,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251546139] [2021-12-07 01:43:31,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251546139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:31,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149166461] [2021-12-07 01:43:31,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:43:31,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:31,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:31,929 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:31,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 01:43:32,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:43:32,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:43:32,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 01:43:32,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-07 01:43:32,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:43:32,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149166461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:32,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:43:32,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-07 01:43:32,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413524467] [2021-12-07 01:43:32,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:32,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:43:32,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:32,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:43:32,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:43:32,047 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2021-12-07 01:43:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:32,086 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2021-12-07 01:43:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:43:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 [2021-12-07 01:43:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:32,087 INFO L225 Difference]: With dead ends: 213 [2021-12-07 01:43:32,087 INFO L226 Difference]: Without dead ends: 130 [2021-12-07 01:43:32,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:43:32,089 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:32,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:43:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-07 01:43:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2021-12-07 01:43:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 115 states have internal predecessors, (147), 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) [2021-12-07 01:43:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2021-12-07 01:43:32,101 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 29 [2021-12-07 01:43:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:32,101 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2021-12-07 01:43:32,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2021-12-07 01:43:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2021-12-07 01:43:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-07 01:43:32,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:32,102 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:32,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-07 01:43:32,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-07 01:43:32,303 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2021-12-07 01:43:32,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:32,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606847086] [2021-12-07 01:43:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:32,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:32,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:32,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606847086] [2021-12-07 01:43:32,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606847086] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:32,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506388939] [2021-12-07 01:43:32,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:32,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:32,508 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:32,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-07 01:43:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:32,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-07 01:43:32,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:32,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:32,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:32,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:32,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:32,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2021-12-07 01:43:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:32,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506388939] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:32,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:32,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-12-07 01:43:32,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862343026] [2021-12-07 01:43:32,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:32,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-07 01:43:32,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:32,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-07 01:43:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-12-07 01:43:32,786 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 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) [2021-12-07 01:43:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:33,061 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2021-12-07 01:43:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-07 01:43:33,061 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 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 [2021-12-07 01:43:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:33,062 INFO L225 Difference]: With dead ends: 185 [2021-12-07 01:43:33,062 INFO L226 Difference]: Without dead ends: 183 [2021-12-07 01:43:33,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2021-12-07 01:43:33,063 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 185 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:33,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 253 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-07 01:43:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2021-12-07 01:43:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.26890756302521) internal successors, (151), 119 states have internal predecessors, (151), 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) [2021-12-07 01:43:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2021-12-07 01:43:33,073 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 29 [2021-12-07 01:43:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:33,073 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2021-12-07 01:43:33,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 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) [2021-12-07 01:43:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2021-12-07 01:43:33,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:43:33,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:33,074 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:33,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-07 01:43:33,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:33,276 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:33,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2021-12-07 01:43:33,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:33,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833079481] [2021-12-07 01:43:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:33,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:33,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833079481] [2021-12-07 01:43:33,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833079481] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852235653] [2021-12-07 01:43:33,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 01:43:33,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:33,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:33,845 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:33,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-07 01:43:33,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-07 01:43:33,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:43:33,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-07 01:43:33,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:33,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:43:34,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,011 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-07 01:43:34,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2021-12-07 01:43:34,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:34,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,208 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-07 01:43:34,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 73 [2021-12-07 01:43:34,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,348 INFO L354 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2021-12-07 01:43:34,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 84 [2021-12-07 01:43:35,183 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:43:35,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 23 [2021-12-07 01:43:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:35,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:57,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_22| Int) (|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_415 Int) (v_ArrVal_413 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_33|) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_22| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_413))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4)) v_ArrVal_415)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_22| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) is different from false [2021-12-07 01:44:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-07 01:44:27,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852235653] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:27,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:44:27,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 47 [2021-12-07 01:44:27,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352573456] [2021-12-07 01:44:27,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:27,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-07 01:44:27,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:44:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-07 01:44:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1719, Unknown=9, NotChecked=88, Total=2162 [2021-12-07 01:44:27,712 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 47 states have internal predecessors, (84), 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) [2021-12-07 01:44:28,553 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 76)) 4) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (forall ((|v_ULTIMATE.start_main_~x~0#1_22| Int) (|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_415 Int) (v_ArrVal_413 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_33|) (<= 0 (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_22| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_413))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4)) v_ArrVal_415)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_22| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:44:29,323 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 76)) 4) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (forall ((|v_ULTIMATE.start_main_~x~0#1_22| Int) (|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_415 Int) (v_ArrVal_413 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_33|) (<= 0 (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_22| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_413))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4)) v_ArrVal_415)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_22| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:44:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:30,185 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2021-12-07 01:44:30,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-07 01:44:30,185 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 47 states have internal predecessors, (84), 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 31 [2021-12-07 01:44:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:30,186 INFO L225 Difference]: With dead ends: 149 [2021-12-07 01:44:30,186 INFO L226 Difference]: Without dead ends: 129 [2021-12-07 01:44:30,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=648, Invalid=2893, Unknown=11, NotChecked=354, Total=3906 [2021-12-07 01:44:30,188 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:30,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 354 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 259 Invalid, 0 Unknown, 176 Unchecked, 0.2s Time] [2021-12-07 01:44:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-07 01:44:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2021-12-07 01:44:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.272) internal successors, (159), 125 states have internal predecessors, (159), 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) [2021-12-07 01:44:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 159 transitions. [2021-12-07 01:44:30,196 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 159 transitions. Word has length 31 [2021-12-07 01:44:30,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:30,197 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 159 transitions. [2021-12-07 01:44:30,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 47 states have internal predecessors, (84), 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) [2021-12-07 01:44:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2021-12-07 01:44:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:44:30,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:30,197 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:30,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:30,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-07 01:44:30,398 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:44:30,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2021-12-07 01:44:30,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:44:30,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545202681] [2021-12-07 01:44:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:30,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:44:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-07 01:44:30,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:44:30,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545202681] [2021-12-07 01:44:30,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545202681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:30,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:30,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:44:30,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267628720] [2021-12-07 01:44:30,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:30,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:30,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:44:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:30,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:30,467 INFO L87 Difference]: Start difference. First operand 126 states and 159 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2021-12-07 01:44:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:30,493 INFO L93 Difference]: Finished difference Result 202 states and 252 transitions. [2021-12-07 01:44:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:44:30,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 31 [2021-12-07 01:44:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:30,498 INFO L225 Difference]: With dead ends: 202 [2021-12-07 01:44:30,498 INFO L226 Difference]: Without dead ends: 146 [2021-12-07 01:44:30,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:30,499 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:30,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 73 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:44:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-07 01:44:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2021-12-07 01:44:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.264) internal successors, (158), 125 states have internal predecessors, (158), 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) [2021-12-07 01:44:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2021-12-07 01:44:30,508 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 31 [2021-12-07 01:44:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:30,509 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2021-12-07 01:44:30,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2021-12-07 01:44:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2021-12-07 01:44:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-07 01:44:30,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:30,509 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:30,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 01:44:30,510 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:44:30,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:30,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 2 times [2021-12-07 01:44:30,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:44:30,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932618639] [2021-12-07 01:44:30,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:30,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:44:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:44:30,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:44:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932618639] [2021-12-07 01:44:30,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932618639] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:44:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794927020] [2021-12-07 01:44:30,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:44:30,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:44:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:44:30,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:44:30,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-07 01:44:30,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:44:30,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:44:30,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-07 01:44:30,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:44:30,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:44:30,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794927020] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:30,762 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:44:30,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-07 01:44:30,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949243945] [2021-12-07 01:44:30,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:30,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 01:44:30,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:44:30,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 01:44:30,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:44:30,763 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 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) [2021-12-07 01:44:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:30,940 INFO L93 Difference]: Finished difference Result 408 states and 511 transitions. [2021-12-07 01:44:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:44:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 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 33 [2021-12-07 01:44:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:30,942 INFO L225 Difference]: With dead ends: 408 [2021-12-07 01:44:30,942 INFO L226 Difference]: Without dead ends: 303 [2021-12-07 01:44:30,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-12-07 01:44:30,943 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 191 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:30,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 181 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:44:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-07 01:44:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 209. [2021-12-07 01:44:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 208 states have internal predecessors, (267), 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) [2021-12-07 01:44:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 267 transitions. [2021-12-07 01:44:30,958 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 267 transitions. Word has length 33 [2021-12-07 01:44:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:30,958 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 267 transitions. [2021-12-07 01:44:30,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 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) [2021-12-07 01:44:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 267 transitions. [2021-12-07 01:44:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:44:30,959 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:30,962 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:30,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-07 01:44:31,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:44:31,163 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:44:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2021-12-07 01:44:31,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:44:31,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198067885] [2021-12-07 01:44:31,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:31,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:44:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:44:31,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:44:31,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198067885] [2021-12-07 01:44:31,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198067885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:44:31,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733943104] [2021-12-07 01:44:31,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-07 01:44:31,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:44:31,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:44:31,230 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:44:31,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-07 01:44:31,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-07 01:44:31,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:44:31,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-07 01:44:31,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:44:31,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:44:31,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733943104] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:31,409 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:44:31,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-07 01:44:31,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983501163] [2021-12-07 01:44:31,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:31,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 01:44:31,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:44:31,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 01:44:31,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:44:31,410 INFO L87 Difference]: Start difference. First operand 209 states and 267 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 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) [2021-12-07 01:44:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:31,573 INFO L93 Difference]: Finished difference Result 492 states and 617 transitions. [2021-12-07 01:44:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 01:44:31,574 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 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 34 [2021-12-07 01:44:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:31,576 INFO L225 Difference]: With dead ends: 492 [2021-12-07 01:44:31,576 INFO L226 Difference]: Without dead ends: 470 [2021-12-07 01:44:31,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2021-12-07 01:44:31,577 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 155 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:31,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 251 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:44:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-12-07 01:44:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 294. [2021-12-07 01:44:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.3139931740614335) internal successors, (385), 293 states have internal predecessors, (385), 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) [2021-12-07 01:44:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2021-12-07 01:44:31,601 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 34 [2021-12-07 01:44:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:31,601 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2021-12-07 01:44:31,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 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) [2021-12-07 01:44:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2021-12-07 01:44:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:44:31,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:31,602 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:31,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-07 01:44:31,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-07 01:44:31,803 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:44:31,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2021-12-07 01:44:31,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:44:31,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858681687] [2021-12-07 01:44:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:31,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:44:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 01:44:32,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:44:32,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858681687] [2021-12-07 01:44:32,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858681687] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:44:32,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987505620] [2021-12-07 01:44:32,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:44:32,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:44:32,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:44:32,219 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:44:32,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-07 01:44:32,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:44:32,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:44:32,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-07 01:44:32,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:32,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 32 [2021-12-07 01:44:32,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:44:32,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:32,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-07 01:44:32,475 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-07 01:44:32,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 35 [2021-12-07 01:44:32,560 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-07 01:44:32,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 35 [2021-12-07 01:44:32,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-07 01:44:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-07 01:44:32,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:34,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_31| Int)) (or (forall ((v_ArrVal_570 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2021-12-07 01:44:35,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) is different from false [2021-12-07 01:45:03,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int)) (or (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (v_ArrVal_568 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2021-12-07 01:45:04,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-07 01:45:06,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_565 Int) (v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_565))) (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))))) is different from false [2021-12-07 01:45:08,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_124| Int)) (or (forall ((v_ArrVal_565 Int) (v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_124| 4)) v_ArrVal_565))) (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))))) (< |v_ULTIMATE.start_main_~i~0#1_124| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-07 01:45:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 16 not checked. [2021-12-07 01:45:36,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987505620] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:36,608 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:45:36,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 35 [2021-12-07 01:45:36,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717550995] [2021-12-07 01:45:36,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:36,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-07 01:45:36,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:45:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-07 01:45:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=644, Unknown=29, NotChecked=354, Total=1190 [2021-12-07 01:45:36,610 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 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) [2021-12-07 01:45:38,631 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_124| Int)) (or (forall ((v_ArrVal_565 Int) (v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_124| 4)) v_ArrVal_565))) (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))))) (< |v_ULTIMATE.start_main_~i~0#1_124| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-07 01:45:39,948 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) (and (<= 1 .cse0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (not (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((v_ArrVal_565 Int) (v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_565))) (let ((.cse2 (store .cse3 (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store .cse2 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))))) (= .cse0 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:45:40,750 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1)) is different from false [2021-12-07 01:45:41,337 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 0) 0) (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) is different from false [2021-12-07 01:45:41,867 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1)) is different from false [2021-12-07 01:45:43,875 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int)) (or (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (v_ArrVal_568 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-07 01:45:44,421 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (+ (* 4 |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-07 01:45:46,442 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_31| Int)) (or (forall ((v_ArrVal_570 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-07 01:45:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:49,833 INFO L93 Difference]: Finished difference Result 375 states and 478 transitions. [2021-12-07 01:45:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-07 01:45:49,834 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 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 [2021-12-07 01:45:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:49,835 INFO L225 Difference]: With dead ends: 375 [2021-12-07 01:45:49,835 INFO L226 Difference]: Without dead ends: 373 [2021-12-07 01:45:49,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 76.4s TimeCoverageRelationStatistics Valid=311, Invalid=1038, Unknown=39, NotChecked=1162, Total=2550 [2021-12-07 01:45:49,837 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 133 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 548 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:49,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 384 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 211 Invalid, 0 Unknown, 548 Unchecked, 0.1s Time] [2021-12-07 01:45:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-12-07 01:45:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 328. [2021-12-07 01:45:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.308868501529052) internal successors, (428), 327 states have internal predecessors, (428), 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) [2021-12-07 01:45:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 428 transitions. [2021-12-07 01:45:49,860 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 428 transitions. Word has length 34 [2021-12-07 01:45:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:49,860 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 428 transitions. [2021-12-07 01:45:49,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 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) [2021-12-07 01:45:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 428 transitions. [2021-12-07 01:45:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:45:49,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:49,861 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:45:49,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-07 01:45:50,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-07 01:45:50,062 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:45:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1136182421, now seen corresponding path program 5 times [2021-12-07 01:45:50,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:45:50,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100634622] [2021-12-07 01:45:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:50,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:45:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:45:50,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:45:50,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100634622] [2021-12-07 01:45:50,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100634622] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:45:50,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213531136] [2021-12-07 01:45:50,771 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-07 01:45:50,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:45:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:45:50,772 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:45:50,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-07 01:45:50,934 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-07 01:45:50,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:45:50,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-07 01:45:50,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:50,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:45:51,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,019 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-07 01:45:51,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2021-12-07 01:45:51,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:51,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,243 INFO L354 Elim1Store]: treesize reduction 175, result has 18.6 percent of original size [2021-12-07 01:45:51,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 63 treesize of output 76 [2021-12-07 01:45:51,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:51,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,445 INFO L354 Elim1Store]: treesize reduction 201, result has 15.9 percent of original size [2021-12-07 01:45:51,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 66 treesize of output 74 [2021-12-07 01:45:51,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:51,622 INFO L354 Elim1Store]: treesize reduction 116, result has 22.1 percent of original size [2021-12-07 01:45:51,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 13 case distinctions, treesize of input 61 treesize of output 69 [2021-12-07 01:45:52,021 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-07 01:45:52,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 27 [2021-12-07 01:45:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-07 01:45:52,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:45:55,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_38| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (forall ((v_ArrVal_626 Int) (v_ArrVal_624 Int)) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-07 01:45:57,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 .cse0))) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8 .cse0)) 4)) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-07 01:45:59,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 Int) (|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~x~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_621)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (<= 0 (select (let ((.cse0 (store .cse2 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8 .cse1)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 .cse1)))))) is different from false [2021-12-07 01:46:01,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 Int) (|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| .cse1)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_621))) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 .cse1))) (<= 0 (select (let ((.cse2 (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8 .cse1)) 4)) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))))) is different from false [2021-12-07 01:46:03,308 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 Int) (|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_621))) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (let ((.cse1 (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-07 01:46:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 11 not checked. [2021-12-07 01:46:03,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213531136] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:46:03,515 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:46:03,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 15] total 48 [2021-12-07 01:46:03,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511938331] [2021-12-07 01:46:03,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:46:03,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-07 01:46:03,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:46:03,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-07 01:46:03,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1515, Unknown=6, NotChecked=430, Total=2256 [2021-12-07 01:46:03,517 INFO L87 Difference]: Start difference. First operand 328 states and 428 transitions. Second operand has 48 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 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) [2021-12-07 01:46:04,326 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (<= 3 .cse1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (forall ((v_ArrVal_621 Int) (|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_621))) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (let ((.cse3 (store .cse2 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (select .cse4 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= .cse1 3) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|))))) is different from false [2021-12-07 01:46:05,063 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (<= 3 .cse1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (forall ((v_ArrVal_621 Int) (|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_621))) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (let ((.cse3 (store .cse2 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (select .cse4 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= .cse1 3) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)))) is different from false [2021-12-07 01:46:05,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (<= 3 .cse1) (forall ((v_ArrVal_621 Int) (|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| .cse3)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_621))) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 .cse3))) (<= 0 (select (let ((.cse4 (store .cse2 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse4 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8 .cse3)) 4)) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse5 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= .cse1 3) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1)))) is different from false [2021-12-07 01:46:06,586 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse4 (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (forall ((v_ArrVal_621 Int) (|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~x~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_621)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (<= 0 (select (let ((.cse0 (store .cse2 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8 .cse1)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 .cse1)))))) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (<= 3 .cse4) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |c_ULTIMATE.start_main_~x~0#1|) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1| 1) (exists ((|ULTIMATE.start_main_~#Source~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Source~0#1.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Source~0#1.base|) 0) 0))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse5 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= .cse4 3) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= |c_ULTIMATE.start_main_~j~0#1| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|))))) is different from false [2021-12-07 01:46:07,260 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (<= 3 .cse1) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#Source~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Source~0#1.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Source~0#1.base|) 0) 0))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= .cse1 3) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_626 Int) (v_ArrVal_624 Int)) (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 .cse3))) (<= 0 (select (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse4 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8 .cse3)) 4)) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|))))) is different from false [2021-12-07 01:46:09,265 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* 4 |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (<= 4 .cse0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 3) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (<= 3 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (forall ((|v_ULTIMATE.start_main_~x~0#1_38| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_38| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (forall ((v_ArrVal_626 Int) (v_ArrVal_624 Int)) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_624))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_626)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= .cse0 4) (exists ((|ULTIMATE.start_main_~#Source~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Source~0#1.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Source~0#1.base|) 0) 0))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= |c_ULTIMATE.start_main_~j~0#1| 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:46:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:46:09,596 INFO L93 Difference]: Finished difference Result 355 states and 457 transitions. [2021-12-07 01:46:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-07 01:46:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 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 37 [2021-12-07 01:46:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:46:09,598 INFO L225 Difference]: With dead ends: 355 [2021-12-07 01:46:09,598 INFO L226 Difference]: Without dead ends: 337 [2021-12-07 01:46:09,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=414, Invalid=2168, Unknown=12, NotChecked=1188, Total=3782 [2021-12-07 01:46:09,600 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 42 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:46:09,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 287 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 243 Unchecked, 0.1s Time] [2021-12-07 01:46:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-07 01:46:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 331. [2021-12-07 01:46:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.309090909090909) internal successors, (432), 330 states have internal predecessors, (432), 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) [2021-12-07 01:46:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 432 transitions. [2021-12-07 01:46:09,622 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 432 transitions. Word has length 37 [2021-12-07 01:46:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:46:09,623 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 432 transitions. [2021-12-07 01:46:09,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 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) [2021-12-07 01:46:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 432 transitions. [2021-12-07 01:46:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:46:09,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:46:09,623 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:46:09,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-07 01:46:09,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-07 01:46:09,824 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:46:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:46:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1198222035, now seen corresponding path program 1 times [2021-12-07 01:46:09,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:46:09,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779757523] [2021-12-07 01:46:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:46:09,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:46:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:46:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:46:10,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:46:10,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779757523] [2021-12-07 01:46:10,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779757523] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:46:10,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737026313] [2021-12-07 01:46:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:46:10,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:46:10,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:46:10,506 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:46:10,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-07 01:46:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:46:10,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-07 01:46:10,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:46:10,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:46:10,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:10,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:10,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:10,709 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-07 01:46:10,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 64 [2021-12-07 01:46:11,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:46:11,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,035 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-07 01:46:11,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 83 [2021-12-07 01:46:11,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:46:11,190 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-07 01:46:11,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 81 [2021-12-07 01:46:11,705 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:46:11,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 26 [2021-12-07 01:46:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:46:11,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:46:14,001 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_45| Int)) (or (forall ((v_ArrVal_675 Int) (v_ArrVal_673 Int)) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_673))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_45| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2021-12-07 01:46:15,197 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_675 Int) (v_ArrVal_673 Int) (|v_ULTIMATE.start_main_~x~0#1_45| Int)) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (< |v_ULTIMATE.start_main_~x~0#1_45| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 .cse0))) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_673))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8 .cse0)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-07 01:46:17,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_675 Int) (v_ArrVal_673 Int) (|v_ULTIMATE.start_main_~x~0#1_45| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_45| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_673))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) is different from false [2021-12-07 01:47:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 11 not checked. [2021-12-07 01:47:18,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737026313] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:47:18,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:47:18,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 40 [2021-12-07 01:47:18,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002392842] [2021-12-07 01:47:18,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:47:18,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-07 01:47:18,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:47:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-07 01:47:18,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1115, Unknown=33, NotChecked=216, Total=1560 [2021-12-07 01:47:18,654 INFO L87 Difference]: Start difference. First operand 331 states and 432 transitions. Second operand has 40 states, 40 states have (on average 2.325) internal successors, (93), 40 states have internal predecessors, (93), 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) [2021-12-07 01:47:19,430 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_675 Int) (v_ArrVal_673 Int) (|v_ULTIMATE.start_main_~x~0#1_45| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_45| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_673))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (<= 3 .cse1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 76)) 4) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= .cse1 3) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|))))) is different from false [2021-12-07 01:47:20,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (forall ((v_ArrVal_675 Int) (v_ArrVal_673 Int) (|v_ULTIMATE.start_main_~x~0#1_45| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_45| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_673))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (<= 3 .cse1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 76)) 4) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= .cse1 3) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|))))) is different from false [2021-12-07 01:47:20,847 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse2 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (forall ((v_ArrVal_675 Int) (v_ArrVal_673 Int) (|v_ULTIMATE.start_main_~x~0#1_45| Int)) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (< |v_ULTIMATE.start_main_~x~0#1_45| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 .cse0))) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_673))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8 .cse0)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (<= 3 .cse2) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse3 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 76)) 4) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse4 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= .cse2 3) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= |c_ULTIMATE.start_main_~j~0#1| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|))))) is different from false [2021-12-07 01:47:22,857 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* 4 |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (<= 4 .cse0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 3) (<= 3 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 76)) 4) (<= .cse0 4) (forall ((|v_ULTIMATE.start_main_~x~0#1_45| Int)) (or (forall ((v_ArrVal_675 Int) (v_ArrVal_673 Int)) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_45| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_673))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_45| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= |c_ULTIMATE.start_main_~j~0#1| 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:47:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:47:41,726 INFO L93 Difference]: Finished difference Result 362 states and 466 transitions. [2021-12-07 01:47:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-07 01:47:41,726 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.325) internal successors, (93), 40 states have internal predecessors, (93), 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 37 [2021-12-07 01:47:41,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:47:41,727 INFO L225 Difference]: With dead ends: 362 [2021-12-07 01:47:41,727 INFO L226 Difference]: Without dead ends: 338 [2021-12-07 01:47:41,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 90.2s TimeCoverageRelationStatistics Valid=404, Invalid=2231, Unknown=45, NotChecked=742, Total=3422 [2021-12-07 01:47:41,729 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:47:41,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 332 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 244 Invalid, 0 Unknown, 204 Unchecked, 0.2s Time] [2021-12-07 01:47:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-12-07 01:47:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2021-12-07 01:47:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3093093093093093) internal successors, (436), 333 states have internal predecessors, (436), 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) [2021-12-07 01:47:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 436 transitions. [2021-12-07 01:47:41,752 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 436 transitions. Word has length 37 [2021-12-07 01:47:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:47:41,752 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 436 transitions. [2021-12-07 01:47:41,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.325) internal successors, (93), 40 states have internal predecessors, (93), 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) [2021-12-07 01:47:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 436 transitions. [2021-12-07 01:47:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:47:41,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:47:41,753 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:47:41,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-07 01:47:41,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-07 01:47:41,954 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:47:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:47:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash 380573585, now seen corresponding path program 2 times [2021-12-07 01:47:41,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:47:41,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959032612] [2021-12-07 01:47:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:47:41,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:47:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:47:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-07 01:47:42,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:47:42,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959032612] [2021-12-07 01:47:42,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959032612] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:47:42,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766617484] [2021-12-07 01:47:42,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:47:42,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:47:42,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:47:42,162 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:47:42,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-07 01:47:42,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:47:42,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:47:42,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-07 01:47:42,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:47:42,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 62 [2021-12-07 01:47:42,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2021-12-07 01:47:42,430 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-07 01:47:42,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2021-12-07 01:47:42,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2021-12-07 01:47:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-07 01:47:42,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:47:44,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_52| Int)) (or (forall ((v_ArrVal_719 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_52| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_52| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2021-12-07 01:47:45,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (|v_ULTIMATE.start_main_~x~0#1_52| Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_52| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_52| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2021-12-07 01:47:46,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (|v_ULTIMATE.start_main_~x~0#1_52| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_52| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_52| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) is different from false [2021-12-07 01:47:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 11 not checked. [2021-12-07 01:47:53,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766617484] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:47:53,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:47:53,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2021-12-07 01:47:53,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924096635] [2021-12-07 01:47:53,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:47:53,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-07 01:47:53,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:47:53,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-07 01:47:53,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=420, Unknown=5, NotChecked=132, Total=650 [2021-12-07 01:47:53,066 INFO L87 Difference]: Start difference. First operand 334 states and 436 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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) [2021-12-07 01:47:54,009 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (forall ((v_ArrVal_719 Int) (|v_ULTIMATE.start_main_~x~0#1_52| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_52| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_52| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= .cse0 3) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:47:54,552 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (<= 3 .cse0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (forall ((v_ArrVal_719 Int) (|v_ULTIMATE.start_main_~x~0#1_52| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_52| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_52| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= .cse0 3) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:47:55,100 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (forall ((v_ArrVal_719 Int) (|v_ULTIMATE.start_main_~x~0#1_52| Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_52| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_52| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4 (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) (<= 3 .cse0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= .cse0 3) (= |c_ULTIMATE.start_main_~j~0#1| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:47:57,106 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 3) (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_52| Int)) (or (forall ((v_ArrVal_719 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_52| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_52| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) (= (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* 4 |c_ULTIMATE.start_main_~j~0#1|)) 4) (= |c_ULTIMATE.start_main_~j~0#1| 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-07 01:47:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:47:57,201 INFO L93 Difference]: Finished difference Result 357 states and 461 transitions. [2021-12-07 01:47:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 01:47:57,201 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 37 [2021-12-07 01:47:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:47:57,203 INFO L225 Difference]: With dead ends: 357 [2021-12-07 01:47:57,203 INFO L226 Difference]: Without dead ends: 339 [2021-12-07 01:47:57,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=129, Invalid=592, Unknown=9, NotChecked=392, Total=1122 [2021-12-07 01:47:57,204 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:47:57,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 253 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 134 Unchecked, 0.0s Time] [2021-12-07 01:47:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-12-07 01:47:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 334. [2021-12-07 01:47:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3093093093093093) internal successors, (436), 333 states have internal predecessors, (436), 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) [2021-12-07 01:47:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 436 transitions. [2021-12-07 01:47:57,227 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 436 transitions. Word has length 37 [2021-12-07 01:47:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:47:57,227 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 436 transitions. [2021-12-07 01:47:57,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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) [2021-12-07 01:47:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 436 transitions. [2021-12-07 01:47:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:47:57,228 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:47:57,228 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:47:57,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-07 01:47:57,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:47:57,429 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:47:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:47:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -607216299, now seen corresponding path program 3 times [2021-12-07 01:47:57,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:47:57,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131183077] [2021-12-07 01:47:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:47:57,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:47:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:47:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:47:57,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:47:57,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131183077] [2021-12-07 01:47:57,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131183077] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:47:57,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683322528] [2021-12-07 01:47:57,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 01:47:57,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:47:57,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:47:57,731 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:47:57,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-07 01:47:57,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-07 01:47:57,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:47:57,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-07 01:47:57,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:47:57,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 62 [2021-12-07 01:47:58,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:47:58,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-07 01:47:58,194 INFO L354 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2021-12-07 01:47:58,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2021-12-07 01:47:59,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 13 [2021-12-07 01:47:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:47:59,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:48:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:48:03,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683322528] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:48:03,202 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:48:03,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 41 [2021-12-07 01:48:03,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517140429] [2021-12-07 01:48:03,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:48:03,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-07 01:48:03,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:48:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-07 01:48:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1321, Unknown=2, NotChecked=0, Total=1640 [2021-12-07 01:48:03,204 INFO L87 Difference]: Start difference. First operand 334 states and 436 transitions. Second operand has 41 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 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) [2021-12-07 01:48:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:48:05,265 INFO L93 Difference]: Finished difference Result 600 states and 754 transitions. [2021-12-07 01:48:05,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-07 01:48:05,266 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 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 37 [2021-12-07 01:48:05,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:48:05,268 INFO L225 Difference]: With dead ends: 600 [2021-12-07 01:48:05,268 INFO L226 Difference]: Without dead ends: 571 [2021-12-07 01:48:05,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=983, Invalid=3844, Unknown=3, NotChecked=0, Total=4830 [2021-12-07 01:48:05,270 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 202 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:48:05,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 426 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 270 Invalid, 0 Unknown, 278 Unchecked, 0.1s Time] [2021-12-07 01:48:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-12-07 01:48:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 435. [2021-12-07 01:48:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.2995391705069124) internal successors, (564), 434 states have internal predecessors, (564), 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) [2021-12-07 01:48:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 564 transitions. [2021-12-07 01:48:05,304 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 564 transitions. Word has length 37 [2021-12-07 01:48:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:48:05,305 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 564 transitions. [2021-12-07 01:48:05,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 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) [2021-12-07 01:48:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 564 transitions. [2021-12-07 01:48:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:48:05,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:48:05,306 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:48:05,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-07 01:48:05,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:48:05,507 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:48:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:48:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1312147662, now seen corresponding path program 3 times [2021-12-07 01:48:05,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:48:05,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906515298] [2021-12-07 01:48:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:48:05,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:48:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:48:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-07 01:48:05,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:48:05,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906515298] [2021-12-07 01:48:05,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906515298] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:48:05,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490246596] [2021-12-07 01:48:05,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 01:48:05,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:48:05,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:48:05,589 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:48:05,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-07 01:48:05,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-07 01:48:05,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:48:05,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-07 01:48:05,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:48:05,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 49 [2021-12-07 01:48:05,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:48:05,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:48:05,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2021-12-07 01:48:05,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:48:05,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-07 01:48:05,904 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:48:05,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-07 01:48:05,975 INFO L354 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2021-12-07 01:48:05,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2021-12-07 01:48:06,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-07 01:48:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 01:48:06,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:50:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 8 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:50:49,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490246596] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:50:49,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:50:49,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 21] total 44 [2021-12-07 01:50:49,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861170223] [2021-12-07 01:50:49,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:50:49,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-07 01:50:49,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:50:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-07 01:50:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1499, Unknown=72, NotChecked=0, Total=1892 [2021-12-07 01:50:49,587 INFO L87 Difference]: Start difference. First operand 435 states and 564 transitions. Second operand has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 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) [2021-12-07 01:50:53,855 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |c_ULTIMATE.start_main_~nodecount~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_177| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int) (v_ArrVal_818 Int) (v_ArrVal_823 Int) (v_ArrVal_820 Int)) (or (<= (+ |v_ULTIMATE.start_main_~j~0#1_80| 1) 0) (<= 0 (select (let ((.cse0 (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_177| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_818))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_820)))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_823)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |v_ULTIMATE.start_main_~j~0#1_80|))) (< |v_ULTIMATE.start_main_~i~0#1_177| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= 3 |c_ULTIMATE.start_main_~nodecount~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) is different from false [2021-12-07 01:51:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:51:48,706 INFO L93 Difference]: Finished difference Result 919 states and 1161 transitions. [2021-12-07 01:51:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-12-07 01:51:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 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 37 [2021-12-07 01:51:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:51:48,710 INFO L225 Difference]: With dead ends: 919 [2021-12-07 01:51:48,710 INFO L226 Difference]: Without dead ends: 870 [2021-12-07 01:51:48,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 3970 ImplicationChecksByTransitivity, 221.1s TimeCoverageRelationStatistics Valid=1747, Invalid=9080, Unknown=97, NotChecked=206, Total=11130 [2021-12-07 01:51:48,714 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 419 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:51:48,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 554 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 514 Invalid, 0 Unknown, 750 Unchecked, 0.3s Time] [2021-12-07 01:51:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2021-12-07 01:51:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 454. [2021-12-07 01:51:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.293598233995585) internal successors, (586), 453 states have internal predecessors, (586), 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) [2021-12-07 01:51:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 586 transitions. [2021-12-07 01:51:48,755 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 586 transitions. Word has length 37 [2021-12-07 01:51:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:51:48,756 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 586 transitions. [2021-12-07 01:51:48,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 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) [2021-12-07 01:51:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 586 transitions. [2021-12-07 01:51:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:51:48,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:51:48,757 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:51:48,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-07 01:51:48,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:51:48,958 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:51:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:51:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1630806470, now seen corresponding path program 1 times [2021-12-07 01:51:48,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:51:48,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675810263] [2021-12-07 01:51:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:51:48,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:51:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:51:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-07 01:51:50,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:51:50,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675810263] [2021-12-07 01:51:50,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675810263] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:51:50,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202236951] [2021-12-07 01:51:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:51:50,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:51:50,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:51:50,098 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:51:50,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-07 01:51:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:51:50,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-07 01:51:50,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:51:50,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 01:51:50,257 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-07 01:51:50,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2021-12-07 01:51:50,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:51:50,379 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-07 01:51:50,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 42 treesize of output 50 [2021-12-07 01:51:50,579 INFO L354 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-07 01:51:50,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 55 [2021-12-07 01:51:50,827 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-07 01:51:50,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 71 [2021-12-07 01:51:50,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:51:50,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:51:50,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:51:50,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 18 [2021-12-07 01:51:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-07 01:51:50,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:52:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 8 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-07 01:52:22,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202236951] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:52:22,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:52:22,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-07 01:52:22,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445629190] [2021-12-07 01:52:22,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:52:22,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-07 01:52:22,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:52:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-07 01:52:22,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=664, Unknown=15, NotChecked=0, Total=812 [2021-12-07 01:52:22,420 INFO L87 Difference]: Start difference. First operand 454 states and 586 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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) [2021-12-07 01:52:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:52:30,761 INFO L93 Difference]: Finished difference Result 959 states and 1211 transitions. [2021-12-07 01:52:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-07 01:52:30,762 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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 38 [2021-12-07 01:52:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:52:30,765 INFO L225 Difference]: With dead ends: 959 [2021-12-07 01:52:30,765 INFO L226 Difference]: Without dead ends: 796 [2021-12-07 01:52:30,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=303, Invalid=1318, Unknown=19, NotChecked=0, Total=1640 [2021-12-07 01:52:30,766 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 189 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:52:30,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 401 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 290 Invalid, 0 Unknown, 273 Unchecked, 0.3s Time] [2021-12-07 01:52:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-12-07 01:52:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 549. [2021-12-07 01:52:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.302919708029197) internal successors, (714), 548 states have internal predecessors, (714), 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) [2021-12-07 01:52:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 714 transitions. [2021-12-07 01:52:30,819 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 714 transitions. Word has length 38 [2021-12-07 01:52:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:52:30,819 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 714 transitions. [2021-12-07 01:52:30,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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) [2021-12-07 01:52:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 714 transitions. [2021-12-07 01:52:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:52:30,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:52:30,820 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:52:30,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-07 01:52:31,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:52:31,021 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:52:31,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:52:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 670016120, now seen corresponding path program 1 times [2021-12-07 01:52:31,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:52:31,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83059524] [2021-12-07 01:52:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:52:31,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:52:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:52:31,084 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 01:52:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:52:31,127 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 01:52:31,128 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 01:52:31,128 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:52:31,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-07 01:52:31,132 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-07 01:52:31,134 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:52:31,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:52:31 BoogieIcfgContainer [2021-12-07 01:52:31,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:52:31,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:52:31,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:52:31,176 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:52:31,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:15" (3/4) ... [2021-12-07 01:52:31,179 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 01:52:31,231 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 01:52:31,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:52:31,232 INFO L158 Benchmark]: Toolchain (without parser) took 555994.98ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 72.7MB in the beginning and 90.5MB in the end (delta: -17.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2021-12-07 01:52:31,232 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:52:31,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 83.7MB in the end (delta: -11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 01:52:31,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.08ms. Allocated memory is still 109.1MB. Free memory was 83.3MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:52:31,233 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 109.1MB. Free memory was 81.1MB in the beginning and 79.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:52:31,233 INFO L158 Benchmark]: RCFGBuilder took 269.84ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 65.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-07 01:52:31,233 INFO L158 Benchmark]: TraceAbstraction took 555381.13ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 64.9MB in the beginning and 95.7MB in the end (delta: -30.9MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2021-12-07 01:52:31,234 INFO L158 Benchmark]: Witness Printer took 55.13ms. Allocated memory is still 132.1MB. Free memory was 95.7MB in the beginning and 90.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-07 01:52:31,235 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.13ms. Allocated memory is still 109.1MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 83.7MB in the end (delta: -11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.08ms. Allocated memory is still 109.1MB. Free memory was 83.3MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.62ms. Allocated memory is still 109.1MB. Free memory was 81.1MB in the beginning and 79.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 269.84ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 65.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 555381.13ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 64.9MB in the beginning and 95.7MB in the end (delta: -30.9MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 55.13ms. Allocated memory is still 132.1MB. Free memory was 95.7MB in the beginning and 90.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int INFINITY = 899; VAL [INFINITY=899] [L18] int nodecount = __VERIFIER_nondet_int(); [L19] int edgecount = __VERIFIER_nondet_int(); [L20] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L21] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L22] int source = 0; [L23] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L24] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L25] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L26] int distance[5]; [L27] int x,y; [L28] int i,j; [L30] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L31] COND TRUE i == source [L32] distance[i] = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L31] COND FALSE !(i == source) [L35] distance[i] = INFINITY VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L30] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L39] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={22:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND TRUE distance[x] > distance[y] + Weight[j] [L47] distance[x] = -1 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L41] j++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={22:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={21:0}, source=0, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L41] j++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L39] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L51] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L51] COND TRUE i < edgecount [L53] EXPR Dest[i] [L53] x = Dest[i] [L54] EXPR Source[i] [L54] y = Source[i] [L55] EXPR distance[x] [L55] EXPR distance[y] [L55] EXPR Weight[i] VAL [Dest={23:0}, distance={22:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, Weight[i]=0, x=1, y=0] [L55] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L51] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L51] COND FALSE !(i < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L61] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] [L63] CALL __VERIFIER_assert(distance[i]>=0) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L63] RET __VERIFIER_assert(distance[i]>=0) [L61] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] [L63] CALL __VERIFIER_assert(distance[i]>=0) [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L12] reach_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 555.3s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 125.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2361 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2361 mSDsluCounter, 4977 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2796 IncrementalHoareTripleChecker+Unchecked, 4287 mSDsCounter, 706 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3844 IncrementalHoareTripleChecker+Invalid, 7346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 706 mSolverCounterUnsat, 690 mSDtfsCounter, 3844 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1616 GetRequests, 899 SyntacticMatches, 48 SemanticMatches, 669 ConstructedPredicates, 51 IntricatePredicates, 1 DeprecatedPredicates, 9805 ImplicationChecksByTransitivity, 532.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549occurred in iteration=22, InterpolantAutomatonStates: 409, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 1570 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 423.1s InterpolantComputationTime, 1255 NumberOfCodeBlocks, 1246 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1706 ConstructedInterpolants, 247 QuantifiedInterpolants, 29011 SizeOfPredicates, 226 NumberOfNonLiveVariables, 5405 ConjunctsInSsa, 498 ConjunctsInUnsatCore, 59 InterpolantComputations, 4 PerfectInterpolantSequences, 300/834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-07 01:52:31,443 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-12-07 01:52:31,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_396e5f93-d230-4211-8927-b3a10c023e3a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE