./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU --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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 23:06:43,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 23:06:43,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 23:06:43,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 23:06:43,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 23:06:43,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 23:06:43,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 23:06:43,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 23:06:43,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 23:06:43,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 23:06:43,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 23:06:43,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 23:06:43,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 23:06:43,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 23:06:43,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 23:06:43,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 23:06:43,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 23:06:43,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 23:06:43,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 23:06:43,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 23:06:43,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 23:06:43,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 23:06:43,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 23:06:43,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 23:06:43,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 23:06:43,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 23:06:43,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 23:06:43,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 23:06:43,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 23:06:43,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 23:06:43,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 23:06:43,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 23:06:43,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 23:06:43,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 23:06:43,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 23:06:43,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 23:06:43,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 23:06:43,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 23:06:43,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 23:06:43,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 23:06:43,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 23:06:43,594 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 23:06:43,646 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 23:06:43,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 23:06:43,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 23:06:43,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 23:06:43,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 23:06:43,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 23:06:43,659 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 23:06:43,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 23:06:43,659 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 23:06:43,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 23:06:43,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 23:06:43,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 23:06:43,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 23:06:43,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 23:06:43,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 23:06:43,662 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 23:06:43,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 23:06:43,663 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 23:06:43,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 23:06:43,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 23:06:43,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 23:06:43,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 23:06:43,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:06:43,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 23:06:43,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 23:06:43,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 23:06:43,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 23:06:43,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 23:06:43,666 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 23:06:43,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 23:06:43,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 23:06:43,669 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 23:06:43,669 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_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/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_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2021-11-02 23:06:43,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 23:06:44,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 23:06:44,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 23:06:44,010 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 23:06:44,011 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 23:06:44,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/loop-invgen/heapsort.i [2021-11-02 23:06:44,085 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/data/75354578d/4a97b59b4ecc43da817748e386294069/FLAG4344c1e0a [2021-11-02 23:06:44,650 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 23:06:44,651 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/sv-benchmarks/c/loop-invgen/heapsort.i [2021-11-02 23:06:44,659 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/data/75354578d/4a97b59b4ecc43da817748e386294069/FLAG4344c1e0a [2021-11-02 23:06:45,049 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/data/75354578d/4a97b59b4ecc43da817748e386294069 [2021-11-02 23:06:45,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 23:06:45,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 23:06:45,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 23:06:45,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 23:06:45,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 23:06:45,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bf5faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45, skipping insertion in model container [2021-11-02 23:06:45,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 23:06:45,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 23:06:45,305 WARN L228 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_c9e422ad-4b19-402c-8f2f-4155177d951d/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2021-11-02 23:06:45,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:06:45,338 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 23:06:45,354 WARN L228 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_c9e422ad-4b19-402c-8f2f-4155177d951d/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2021-11-02 23:06:45,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:06:45,383 INFO L208 MainTranslator]: Completed translation [2021-11-02 23:06:45,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45 WrapperNode [2021-11-02 23:06:45,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 23:06:45,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 23:06:45,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 23:06:45,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 23:06:45,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 23:06:45,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 23:06:45,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 23:06:45,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 23:06:45,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 23:06:45,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 23:06:45,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 23:06:45,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 23:06:45,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (1/1) ... [2021-11-02 23:06:45,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:06:45,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:06:45,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 23:06:45,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 23:06:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 23:06:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 23:06:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 23:06:45,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 23:06:46,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 23:06:46,110 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-11-02 23:06:46,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:06:46 BoogieIcfgContainer [2021-11-02 23:06:46,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 23:06:46,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 23:06:46,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 23:06:46,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 23:06:46,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:06:45" (1/3) ... [2021-11-02 23:06:46,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aed00ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:06:46, skipping insertion in model container [2021-11-02 23:06:46,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:06:45" (2/3) ... [2021-11-02 23:06:46,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aed00ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:06:46, skipping insertion in model container [2021-11-02 23:06:46,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:06:46" (3/3) ... [2021-11-02 23:06:46,124 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2021-11-02 23:06:46,134 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 23:06:46,148 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-02 23:06:46,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 23:06:46,265 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-11-02 23:06:46,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-02 23:06:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 70 states have internal predecessors, (94), 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-11-02 23:06:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-02 23:06:46,296 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:46,297 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:46,298 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1222313301, now seen corresponding path program 1 times [2021-11-02 23:06:46,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:46,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413365110] [2021-11-02 23:06:46,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:46,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:46,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:46,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413365110] [2021-11-02 23:06:46,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413365110] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:46,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:46,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 23:06:46,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415187542] [2021-11-02 23:06:46,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 23:06:46,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:46,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 23:06:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 23:06:46,589 INFO L87 Difference]: Start difference. First operand has 71 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 70 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-02 23:06:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:46,614 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2021-11-02 23:06:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 23:06:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-11-02 23:06:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:46,628 INFO L225 Difference]: With dead ends: 138 [2021-11-02 23:06:46,629 INFO L226 Difference]: Without dead ends: 67 [2021-11-02 23:06:46,633 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 23:06:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-02 23:06:46,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-11-02 23:06:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 66 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-11-02 23:06:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2021-11-02 23:06:46,681 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 9 [2021-11-02 23:06:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:46,682 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2021-11-02 23:06:46,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-02 23:06:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2021-11-02 23:06:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-02 23:06:46,685 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:46,685 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:46,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 23:06:46,686 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1218380889, now seen corresponding path program 1 times [2021-11-02 23:06:46,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:46,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828385544] [2021-11-02 23:06:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:46,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:46,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:46,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828385544] [2021-11-02 23:06:46,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828385544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:46,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:46,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:06:46,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438206362] [2021-11-02 23:06:46,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:06:46,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:46,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:06:46,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:06:46,906 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-11-02 23:06:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:47,031 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-11-02 23:06:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:06:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2021-11-02 23:06:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:47,035 INFO L225 Difference]: With dead ends: 72 [2021-11-02 23:06:47,035 INFO L226 Difference]: Without dead ends: 70 [2021-11-02 23:06:47,036 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-02 23:06:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-02 23:06:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2021-11-02 23:06:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 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-11-02 23:06:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-11-02 23:06:47,054 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 9 [2021-11-02 23:06:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:47,055 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-11-02 23:06:47,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-11-02 23:06:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-11-02 23:06:47,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-02 23:06:47,056 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:47,057 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:47,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 23:06:47,057 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:47,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1218404721, now seen corresponding path program 1 times [2021-11-02 23:06:47,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:47,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211468563] [2021-11-02 23:06:47,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:47,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:47,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:47,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211468563] [2021-11-02 23:06:47,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211468563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:47,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:47,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:06:47,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2302500] [2021-11-02 23:06:47,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:06:47,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:47,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:06:47,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:06:47,228 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-11-02 23:06:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:47,381 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-11-02 23:06:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 23:06:47,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-11-02 23:06:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:47,383 INFO L225 Difference]: With dead ends: 72 [2021-11-02 23:06:47,383 INFO L226 Difference]: Without dead ends: 70 [2021-11-02 23:06:47,384 INFO L786 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-11-02 23:06:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-02 23:06:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2021-11-02 23:06:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-11-02 23:06:47,393 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 9 [2021-11-02 23:06:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:47,394 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-11-02 23:06:47,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-11-02 23:06:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-11-02 23:06:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-02 23:06:47,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:47,395 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:47,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 23:06:47,396 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1218310388, now seen corresponding path program 1 times [2021-11-02 23:06:47,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:47,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554233608] [2021-11-02 23:06:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:47,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:47,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:47,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554233608] [2021-11-02 23:06:47,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554233608] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:47,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:47,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:06:47,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949430963] [2021-11-02 23:06:47,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:06:47,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:06:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:06:47,475 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-11-02 23:06:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:47,697 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2021-11-02 23:06:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:06:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2021-11-02 23:06:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:47,702 INFO L225 Difference]: With dead ends: 128 [2021-11-02 23:06:47,702 INFO L226 Difference]: Without dead ends: 120 [2021-11-02 23:06:47,703 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:06:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-02 23:06:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2021-11-02 23:06:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 93 states have internal predecessors, (112), 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-11-02 23:06:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2021-11-02 23:06:47,733 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 9 [2021-11-02 23:06:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:47,733 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2021-11-02 23:06:47,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-11-02 23:06:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2021-11-02 23:06:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 23:06:47,734 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:47,734 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:47,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 23:06:47,735 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:47,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:47,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1661877060, now seen corresponding path program 1 times [2021-11-02 23:06:47,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:47,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924605210] [2021-11-02 23:06:47,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:47,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:47,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:47,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924605210] [2021-11-02 23:06:47,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924605210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:47,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:47,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:06:47,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962939429] [2021-11-02 23:06:47,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:06:47,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:06:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:06:47,860 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-11-02 23:06:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:48,123 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2021-11-02 23:06:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:06:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2021-11-02 23:06:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:48,127 INFO L225 Difference]: With dead ends: 156 [2021-11-02 23:06:48,127 INFO L226 Difference]: Without dead ends: 154 [2021-11-02 23:06:48,129 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:06:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-02 23:06:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2021-11-02 23:06:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 127 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-11-02 23:06:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2021-11-02 23:06:48,168 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 11 [2021-11-02 23:06:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:48,169 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2021-11-02 23:06:48,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-11-02 23:06:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2021-11-02 23:06:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 23:06:48,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:48,171 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:48,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 23:06:48,172 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1638973740, now seen corresponding path program 1 times [2021-11-02 23:06:48,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:48,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245609063] [2021-11-02 23:06:48,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:48,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:48,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:48,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245609063] [2021-11-02 23:06:48,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245609063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:48,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:48,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:06:48,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457480930] [2021-11-02 23:06:48,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:06:48,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:48,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:06:48,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:06:48,246 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-02 23:06:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:48,328 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2021-11-02 23:06:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:06:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2021-11-02 23:06:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:48,330 INFO L225 Difference]: With dead ends: 138 [2021-11-02 23:06:48,330 INFO L226 Difference]: Without dead ends: 136 [2021-11-02 23:06:48,330 INFO L786 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-11-02 23:06:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-02 23:06:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2021-11-02 23:06:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 125 states have internal predecessors, (154), 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-11-02 23:06:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2021-11-02 23:06:48,345 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 11 [2021-11-02 23:06:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:48,345 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2021-11-02 23:06:48,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-02 23:06:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2021-11-02 23:06:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 23:06:48,346 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:48,346 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:48,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 23:06:48,347 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:48,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1729632713, now seen corresponding path program 1 times [2021-11-02 23:06:48,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:48,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292800774] [2021-11-02 23:06:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:48,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:48,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:48,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292800774] [2021-11-02 23:06:48,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292800774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:48,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:48,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:06:48,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650395341] [2021-11-02 23:06:48,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:06:48,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:06:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:06:48,405 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-11-02 23:06:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:48,646 INFO L93 Difference]: Finished difference Result 235 states and 279 transitions. [2021-11-02 23:06:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:06:48,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2021-11-02 23:06:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:48,648 INFO L225 Difference]: With dead ends: 235 [2021-11-02 23:06:48,648 INFO L226 Difference]: Without dead ends: 229 [2021-11-02 23:06:48,649 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:06:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-02 23:06:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 174. [2021-11-02 23:06:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 173 states have internal predecessors, (220), 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-11-02 23:06:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 220 transitions. [2021-11-02 23:06:48,668 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 220 transitions. Word has length 11 [2021-11-02 23:06:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:48,669 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 220 transitions. [2021-11-02 23:06:48,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-11-02 23:06:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 220 transitions. [2021-11-02 23:06:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 23:06:48,670 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:48,670 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:48,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 23:06:48,670 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:48,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1823743610, now seen corresponding path program 1 times [2021-11-02 23:06:48,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:48,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133102855] [2021-11-02 23:06:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:48,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:48,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:48,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133102855] [2021-11-02 23:06:48,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133102855] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:48,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:48,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:06:48,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249977556] [2021-11-02 23:06:48,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:06:48,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:48,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:06:48,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:06:48,698 INFO L87 Difference]: Start difference. First operand 174 states and 220 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-11-02 23:06:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:48,730 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2021-11-02 23:06:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:06:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-11-02 23:06:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:48,733 INFO L225 Difference]: With dead ends: 375 [2021-11-02 23:06:48,733 INFO L226 Difference]: Without dead ends: 291 [2021-11-02 23:06:48,734 INFO L786 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-11-02 23:06:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-02 23:06:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 271. [2021-11-02 23:06:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 261 states have (on average 1.371647509578544) internal successors, (358), 270 states have internal predecessors, (358), 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-11-02 23:06:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2021-11-02 23:06:48,760 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 11 [2021-11-02 23:06:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:48,760 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2021-11-02 23:06:48,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-11-02 23:06:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2021-11-02 23:06:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 23:06:48,761 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:48,762 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:48,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 23:06:48,762 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:48,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1755987957, now seen corresponding path program 1 times [2021-11-02 23:06:48,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:48,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902511399] [2021-11-02 23:06:48,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:48,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:48,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:48,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902511399] [2021-11-02 23:06:48,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902511399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:48,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:48,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:06:48,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015908358] [2021-11-02 23:06:48,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:06:48,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:48,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:06:48,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:06:48,798 INFO L87 Difference]: Start difference. First operand 271 states and 358 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-02 23:06:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:48,866 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2021-11-02 23:06:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:06:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2021-11-02 23:06:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:48,869 INFO L225 Difference]: With dead ends: 284 [2021-11-02 23:06:48,869 INFO L226 Difference]: Without dead ends: 240 [2021-11-02 23:06:48,870 INFO L786 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-11-02 23:06:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-02 23:06:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-11-02 23:06:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 230 states have (on average 1.373913043478261) internal successors, (316), 239 states have internal predecessors, (316), 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-11-02 23:06:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2021-11-02 23:06:48,895 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 11 [2021-11-02 23:06:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:48,895 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2021-11-02 23:06:48,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-02 23:06:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2021-11-02 23:06:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 23:06:48,897 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:48,897 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:48,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 23:06:48,897 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2105123171, now seen corresponding path program 1 times [2021-11-02 23:06:48,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:48,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277178571] [2021-11-02 23:06:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:48,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:48,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:48,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277178571] [2021-11-02 23:06:48,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277178571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:48,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:48,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:06:48,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833955854] [2021-11-02 23:06:48,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:06:48,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:06:48,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:06:48,949 INFO L87 Difference]: Start difference. First operand 240 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11-02 23:06:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:49,113 INFO L93 Difference]: Finished difference Result 380 states and 493 transitions. [2021-11-02 23:06:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 23:06:49,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2021-11-02 23:06:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:49,117 INFO L225 Difference]: With dead ends: 380 [2021-11-02 23:06:49,117 INFO L226 Difference]: Without dead ends: 372 [2021-11-02 23:06:49,118 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:06:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-02 23:06:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 200. [2021-11-02 23:06:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 192 states have (on average 1.34375) internal successors, (258), 199 states have internal predecessors, (258), 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-11-02 23:06:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 258 transitions. [2021-11-02 23:06:49,144 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 258 transitions. Word has length 15 [2021-11-02 23:06:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:49,144 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 258 transitions. [2021-11-02 23:06:49,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11-02 23:06:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 258 transitions. [2021-11-02 23:06:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 23:06:49,147 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:49,148 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:49,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 23:06:49,148 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash 639895389, now seen corresponding path program 1 times [2021-11-02 23:06:49,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:49,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727459458] [2021-11-02 23:06:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:49,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:49,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:49,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727459458] [2021-11-02 23:06:49,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727459458] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:49,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:49,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:06:49,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468303845] [2021-11-02 23:06:49,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:06:49,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:49,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:06:49,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:06:49,240 INFO L87 Difference]: Start difference. First operand 200 states and 258 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11-02 23:06:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:49,367 INFO L93 Difference]: Finished difference Result 302 states and 372 transitions. [2021-11-02 23:06:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:06:49,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2021-11-02 23:06:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:49,370 INFO L225 Difference]: With dead ends: 302 [2021-11-02 23:06:49,370 INFO L226 Difference]: Without dead ends: 300 [2021-11-02 23:06:49,371 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:06:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-02 23:06:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2021-11-02 23:06:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 245 states have internal predecessors, (312), 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-11-02 23:06:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 312 transitions. [2021-11-02 23:06:49,395 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 312 transitions. Word has length 15 [2021-11-02 23:06:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:49,395 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 312 transitions. [2021-11-02 23:06:49,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11-02 23:06:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 312 transitions. [2021-11-02 23:06:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-02 23:06:49,396 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:49,396 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:49,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 23:06:49,397 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1672864291, now seen corresponding path program 1 times [2021-11-02 23:06:49,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:49,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190260526] [2021-11-02 23:06:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:49,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:49,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:49,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190260526] [2021-11-02 23:06:49,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190260526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:49,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:49,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:06:49,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328712611] [2021-11-02 23:06:49,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:06:49,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:06:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:06:49,473 INFO L87 Difference]: Start difference. First operand 246 states and 312 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-11-02 23:06:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:49,655 INFO L93 Difference]: Finished difference Result 734 states and 889 transitions. [2021-11-02 23:06:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 23:06:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2021-11-02 23:06:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:49,659 INFO L225 Difference]: With dead ends: 734 [2021-11-02 23:06:49,659 INFO L226 Difference]: Without dead ends: 556 [2021-11-02 23:06:49,663 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:06:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-11-02 23:06:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 246. [2021-11-02 23:06:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 238 states have (on average 1.3025210084033614) internal successors, (310), 245 states have internal predecessors, (310), 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-11-02 23:06:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2021-11-02 23:06:49,694 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 16 [2021-11-02 23:06:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:49,694 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2021-11-02 23:06:49,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-11-02 23:06:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2021-11-02 23:06:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-02 23:06:49,695 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:49,695 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:49,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 23:06:49,696 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 759304320, now seen corresponding path program 1 times [2021-11-02 23:06:49,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:49,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730112375] [2021-11-02 23:06:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:49,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:49,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:49,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730112375] [2021-11-02 23:06:49,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730112375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:49,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:49,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:06:49,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379631752] [2021-11-02 23:06:49,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:06:49,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:49,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:06:49,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:06:49,778 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-11-02 23:06:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:49,948 INFO L93 Difference]: Finished difference Result 380 states and 474 transitions. [2021-11-02 23:06:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 23:06:49,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2021-11-02 23:06:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:49,952 INFO L225 Difference]: With dead ends: 380 [2021-11-02 23:06:49,953 INFO L226 Difference]: Without dead ends: 378 [2021-11-02 23:06:49,953 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:06:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-11-02 23:06:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 308. [2021-11-02 23:06:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 300 states have (on average 1.3066666666666666) internal successors, (392), 307 states have internal predecessors, (392), 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-11-02 23:06:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 392 transitions. [2021-11-02 23:06:49,988 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 392 transitions. Word has length 17 [2021-11-02 23:06:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:49,989 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 392 transitions. [2021-11-02 23:06:49,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-11-02 23:06:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 392 transitions. [2021-11-02 23:06:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-02 23:06:49,990 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:49,990 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:49,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 23:06:49,991 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -750791926, now seen corresponding path program 1 times [2021-11-02 23:06:49,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:49,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304254251] [2021-11-02 23:06:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:49,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:50,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:50,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304254251] [2021-11-02 23:06:50,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304254251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:50,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:50,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:06:50,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772502236] [2021-11-02 23:06:50,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:06:50,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:06:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:06:50,064 INFO L87 Difference]: Start difference. First operand 308 states and 392 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:50,273 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2021-11-02 23:06:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:06:50,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-02 23:06:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:50,277 INFO L225 Difference]: With dead ends: 410 [2021-11-02 23:06:50,277 INFO L226 Difference]: Without dead ends: 406 [2021-11-02 23:06:50,278 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-02 23:06:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-02 23:06:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 216. [2021-11-02 23:06:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 215 states have internal predecessors, (266), 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-11-02 23:06:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 266 transitions. [2021-11-02 23:06:50,311 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 266 transitions. Word has length 21 [2021-11-02 23:06:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:50,312 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 266 transitions. [2021-11-02 23:06:50,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 266 transitions. [2021-11-02 23:06:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 23:06:50,313 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:50,313 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:50,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 23:06:50,313 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash -234606263, now seen corresponding path program 1 times [2021-11-02 23:06:50,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:50,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939755790] [2021-11-02 23:06:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:50,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:50,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:50,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939755790] [2021-11-02 23:06:50,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939755790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:50,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:50,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:06:50,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114346460] [2021-11-02 23:06:50,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:06:50,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:50,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:06:50,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:06:50,370 INFO L87 Difference]: Start difference. First operand 216 states and 266 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-11-02 23:06:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:50,502 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2021-11-02 23:06:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 23:06:50,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-11-02 23:06:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:50,504 INFO L225 Difference]: With dead ends: 217 [2021-11-02 23:06:50,504 INFO L226 Difference]: Without dead ends: 209 [2021-11-02 23:06:50,506 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:06:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-02 23:06:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2021-11-02 23:06:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 1.203883495145631) internal successors, (248), 207 states have internal predecessors, (248), 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-11-02 23:06:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2021-11-02 23:06:50,534 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 23 [2021-11-02 23:06:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:50,535 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2021-11-02 23:06:50,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-11-02 23:06:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2021-11-02 23:06:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 23:06:50,536 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:50,537 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:50,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 23:06:50,537 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash -900992014, now seen corresponding path program 1 times [2021-11-02 23:06:50,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:50,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855340538] [2021-11-02 23:06:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:50,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:50,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:50,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855340538] [2021-11-02 23:06:50,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855340538] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:50,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:06:50,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:06:50,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613204585] [2021-11-02 23:06:50,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:06:50,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:50,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:06:50,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:06:50,608 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-11-02 23:06:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:50,762 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2021-11-02 23:06:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 23:06:50,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 29 [2021-11-02 23:06:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:50,766 INFO L225 Difference]: With dead ends: 250 [2021-11-02 23:06:50,766 INFO L226 Difference]: Without dead ends: 248 [2021-11-02 23:06:50,767 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-02 23:06:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-02 23:06:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 110. [2021-11-02 23:06:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 109 states have internal predecessors, (128), 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-11-02 23:06:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2021-11-02 23:06:50,798 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 29 [2021-11-02 23:06:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:50,798 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2021-11-02 23:06:50,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-11-02 23:06:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2021-11-02 23:06:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-02 23:06:50,802 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:50,803 INFO L513 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] [2021-11-02 23:06:50,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 23:06:50,804 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 5957045, now seen corresponding path program 1 times [2021-11-02 23:06:50,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:50,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449870474] [2021-11-02 23:06:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:50,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:50,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:50,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449870474] [2021-11-02 23:06:50,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449870474] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:50,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759340256] [2021-11-02 23:06:50,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:50,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:50,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:06:50,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:06:50,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 23:06:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:50,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 23:06:50,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:06:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:51,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759340256] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:51,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:06:51,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2021-11-02 23:06:51,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418974855] [2021-11-02 23:06:51,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:06:51,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:51,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:06:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:06:51,313 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:51,473 INFO L93 Difference]: Finished difference Result 399 states and 463 transitions. [2021-11-02 23:06:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 23:06:51,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-02 23:06:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:51,476 INFO L225 Difference]: With dead ends: 399 [2021-11-02 23:06:51,476 INFO L226 Difference]: Without dead ends: 293 [2021-11-02 23:06:51,477 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-02 23:06:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-02 23:06:51,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 256. [2021-11-02 23:06:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 254 states have (on average 1.188976377952756) internal successors, (302), 255 states have internal predecessors, (302), 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-11-02 23:06:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 302 transitions. [2021-11-02 23:06:51,522 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 302 transitions. Word has length 31 [2021-11-02 23:06:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:51,523 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 302 transitions. [2021-11-02 23:06:51,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 302 transitions. [2021-11-02 23:06:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-02 23:06:51,524 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:51,524 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:51,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-02 23:06:51,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-02 23:06:51,740 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -971191967, now seen corresponding path program 1 times [2021-11-02 23:06:51,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:51,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616778823] [2021-11-02 23:06:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:51,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:51,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:51,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616778823] [2021-11-02 23:06:51,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616778823] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:51,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762484265] [2021-11-02 23:06:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:51,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:51,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:06:51,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:06:51,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 23:06:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:51,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 23:06:51,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:06:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:52,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762484265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:52,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:06:52,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2021-11-02 23:06:52,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027219497] [2021-11-02 23:06:52,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:06:52,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:06:52,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-02 23:06:52,477 INFO L87 Difference]: Start difference. First operand 256 states and 302 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:52,763 INFO L93 Difference]: Finished difference Result 517 states and 601 transitions. [2021-11-02 23:06:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 23:06:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-02 23:06:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:52,767 INFO L225 Difference]: With dead ends: 517 [2021-11-02 23:06:52,767 INFO L226 Difference]: Without dead ends: 295 [2021-11-02 23:06:52,768 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-02 23:06:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-02 23:06:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 220. [2021-11-02 23:06:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 219 states have internal predecessors, (256), 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-11-02 23:06:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2021-11-02 23:06:52,806 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 40 [2021-11-02 23:06:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:52,806 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2021-11-02 23:06:52,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2021-11-02 23:06:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-02 23:06:52,808 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:52,808 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:52,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 23:06:53,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-02 23:06:53,024 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:53,025 INFO L85 PathProgramCache]: Analyzing trace with hash -830643357, now seen corresponding path program 1 times [2021-11-02 23:06:53,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:53,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303644373] [2021-11-02 23:06:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:53,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:53,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:53,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303644373] [2021-11-02 23:06:53,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303644373] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:53,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174750822] [2021-11-02 23:06:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:53,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:53,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:06:53,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:06:53,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 23:06:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:53,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 23:06:53,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:06:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:53,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174750822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:06:53,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:06:53,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-11-02 23:06:53,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019835875] [2021-11-02 23:06:53,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:06:53,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:53,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:06:53,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:06:53,553 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:53,747 INFO L93 Difference]: Finished difference Result 397 states and 459 transitions. [2021-11-02 23:06:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:06:53,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-02 23:06:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:53,749 INFO L225 Difference]: With dead ends: 397 [2021-11-02 23:06:53,750 INFO L226 Difference]: Without dead ends: 164 [2021-11-02 23:06:53,750 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-02 23:06:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-02 23:06:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2021-11-02 23:06:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 137 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-11-02 23:06:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2021-11-02 23:06:53,772 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 40 [2021-11-02 23:06:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:53,773 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2021-11-02 23:06:53,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:06:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2021-11-02 23:06:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 23:06:53,774 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:53,774 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:53,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 23:06:53,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:53,989 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash 34146378, now seen corresponding path program 1 times [2021-11-02 23:06:53,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:53,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536976560] [2021-11-02 23:06:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:53,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:54,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:54,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536976560] [2021-11-02 23:06:54,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536976560] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:54,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730325201] [2021-11-02 23:06:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:54,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:54,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:06:54,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:06:54,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-02 23:06:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:54,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 23:06:54,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:06:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-02 23:06:54,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730325201] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:54,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:06:54,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-11-02 23:06:54,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866815944] [2021-11-02 23:06:54,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 23:06:54,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:54,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 23:06:54,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-02 23:06:54,401 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-11-02 23:06:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:55,394 INFO L93 Difference]: Finished difference Result 316 states and 359 transitions. [2021-11-02 23:06:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-02 23:06:55,394 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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 45 [2021-11-02 23:06:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:55,396 INFO L225 Difference]: With dead ends: 316 [2021-11-02 23:06:55,396 INFO L226 Difference]: Without dead ends: 210 [2021-11-02 23:06:55,397 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2021-11-02 23:06:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-02 23:06:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 136. [2021-11-02 23:06:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 135 states have internal predecessors, (155), 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-11-02 23:06:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2021-11-02 23:06:55,419 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 45 [2021-11-02 23:06:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:55,420 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2021-11-02 23:06:55,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-11-02 23:06:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2021-11-02 23:06:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-02 23:06:55,421 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:55,421 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:55,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-02 23:06:55,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:55,648 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:55,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1979695153, now seen corresponding path program 1 times [2021-11-02 23:06:55,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:55,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256613746] [2021-11-02 23:06:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:55,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:55,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:55,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256613746] [2021-11-02 23:06:55,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256613746] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:55,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797238301] [2021-11-02 23:06:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:55,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:55,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:06:55,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:06:55,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-02 23:06:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:55,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 23:06:55,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:06:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:56,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797238301] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:56,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:06:56,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-11-02 23:06:56,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512717286] [2021-11-02 23:06:56,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 23:06:56,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:56,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 23:06:56,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-02 23:06:56,502 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-11-02 23:06:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:57,373 INFO L93 Difference]: Finished difference Result 617 states and 694 transitions. [2021-11-02 23:06:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-02 23:06:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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 56 [2021-11-02 23:06:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:57,376 INFO L225 Difference]: With dead ends: 617 [2021-11-02 23:06:57,377 INFO L226 Difference]: Without dead ends: 429 [2021-11-02 23:06:57,378 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-11-02 23:06:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-11-02 23:06:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 318. [2021-11-02 23:06:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.1261829652996846) internal successors, (357), 317 states have internal predecessors, (357), 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-11-02 23:06:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 357 transitions. [2021-11-02 23:06:57,438 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 357 transitions. Word has length 56 [2021-11-02 23:06:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:57,438 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 357 transitions. [2021-11-02 23:06:57,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-11-02 23:06:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 357 transitions. [2021-11-02 23:06:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-02 23:06:57,439 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:57,439 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-11-02 23:06:57,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-02 23:06:57,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-02 23:06:57,656 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash -56467119, now seen corresponding path program 1 times [2021-11-02 23:06:57,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:57,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928190292] [2021-11-02 23:06:57,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:57,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:57,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:57,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928190292] [2021-11-02 23:06:57,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928190292] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:57,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842862103] [2021-11-02 23:06:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:57,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:57,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:06:57,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:06:57,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-02 23:06:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:57,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 23:06:57,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:06:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:58,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842862103] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:58,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:06:58,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-11-02 23:06:58,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421366041] [2021-11-02 23:06:58,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 23:06:58,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:06:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 23:06:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-02 23:06:58,320 INFO L87 Difference]: Start difference. First operand 318 states and 357 transitions. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-11-02 23:06:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:06:59,513 INFO L93 Difference]: Finished difference Result 670 states and 747 transitions. [2021-11-02 23:06:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-02 23:06:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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 56 [2021-11-02 23:06:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:06:59,518 INFO L225 Difference]: With dead ends: 670 [2021-11-02 23:06:59,518 INFO L226 Difference]: Without dead ends: 558 [2021-11-02 23:06:59,520 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=1066, Unknown=0, NotChecked=0, Total=1482 [2021-11-02 23:06:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-11-02 23:06:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 293. [2021-11-02 23:06:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.1267123287671232) internal successors, (329), 292 states have internal predecessors, (329), 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-11-02 23:06:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 329 transitions. [2021-11-02 23:06:59,597 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 329 transitions. Word has length 56 [2021-11-02 23:06:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:06:59,598 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 329 transitions. [2021-11-02 23:06:59,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-11-02 23:06:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 329 transitions. [2021-11-02 23:06:59,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-02 23:06:59,599 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:06:59,600 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2021-11-02 23:06:59,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-02 23:06:59,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-02 23:06:59,820 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 23:06:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:06:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 35100067, now seen corresponding path program 2 times [2021-11-02 23:06:59,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:06:59,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026096314] [2021-11-02 23:06:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:06:59,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:06:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:06:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:06:59,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:06:59,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026096314] [2021-11-02 23:06:59,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026096314] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:06:59,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565520284] [2021-11-02 23:06:59,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 23:06:59,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:06:59,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:06:59,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:06:59,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-02 23:07:00,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 23:07:00,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 23:07:00,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 23:07:00,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-02 23:07:00,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565520284] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:00,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:07:00,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2021-11-02 23:07:00,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145333416] [2021-11-02 23:07:00,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 23:07:00,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:00,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 23:07:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-02 23:07:00,756 INFO L87 Difference]: Start difference. First operand 293 states and 329 transitions. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:07:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:02,514 INFO L93 Difference]: Finished difference Result 427 states and 474 transitions. [2021-11-02 23:07:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-02 23:07:02,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-02 23:07:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:02,515 INFO L225 Difference]: With dead ends: 427 [2021-11-02 23:07:02,515 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 23:07:02,517 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=531, Invalid=1361, Unknown=0, NotChecked=0, Total=1892 [2021-11-02 23:07:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 23:07:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 23:07:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11-02 23:07:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 23:07:02,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2021-11-02 23:07:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:02,518 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 23:07:02,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:07:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 23:07:02,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 23:07:02,521 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,522 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,522 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,523 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,523 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,523 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,523 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,524 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,524 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,524 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,524 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,524 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,525 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,525 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:07:02,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-02 23:07:02,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-02 23:07:02,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 23:07:02,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:02,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:03,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:03,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:04,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:04,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:04,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:05,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:05,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:06,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:06,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:06,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:06,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:07,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:07,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:07,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:07:20,524 INFO L853 garLoopResultBuilder]: At program point L18-17(lines 17 22) the Hoare annotation is: (let ((.cse20 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse13 (div ULTIMATE.start_main_~j~0 2)) (.cse5 (div .cse20 (- 2))) (.cse15 (* 2 ULTIMATE.start_main_~l~0)) (.cse6 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse0 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse16 (<= .cse6 (div ULTIMATE.start_main_~r~0 2))) (.cse17 (<= .cse15 ULTIMATE.start_main_~r~0)) (.cse7 (<= .cse5 (+ (div (+ (- 1) ULTIMATE.start_main_~j~0) 2) 1))) (.cse9 (<= .cse15 ULTIMATE.start_main_~j~0)) (.cse18 (<= ULTIMATE.start_main_~i~0 .cse13)) (.cse10 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse19 (< (div (+ .cse20 1) (- 2)) .cse6)) (.cse11 (<= 2 ULTIMATE.start_main_~j~0)) (.cse12 (<= 1 ULTIMATE.start_main_~i~0)) (.cse1 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse2 (<= ULTIMATE.start_main_~l~0 1)) (.cse3 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= 1 ULTIMATE.start_main_~r~0)) (.cse14 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (<= 2 ULTIMATE.start_main_~i~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) .cse7 .cse8 .cse9) (and .cse10 .cse11 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse0 .cse12 (<= .cse5 (+ .cse13 1)) .cse1 .cse2 .cse3 .cse4 .cse14 (<= ULTIMATE.start_main_~j~0 .cse15) .cse8) (and .cse16 .cse17 .cse12 .cse1 .cse3 .cse14 (<= (+ ULTIMATE.start_main_~r~0 5) (* 2 ULTIMATE.start_main_~n~0)) .cse8 .cse9 .cse18) (and (or (and .cse19 .cse17 .cse12 .cse1 .cse3 .cse14 .cse9) (and .cse16 .cse17 .cse12 .cse1 .cse3 .cse14 .cse7 .cse8 .cse9)) .cse8 .cse18) (and .cse10 .cse19 .cse11 .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse8))))) [2021-11-02 23:07:20,525 INFO L857 garLoopResultBuilder]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,525 INFO L853 garLoopResultBuilder]: At program point L18-20(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse7 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse8 (+ ULTIMATE.start_main_~l~0 1)) (.cse1 (<= 2 ULTIMATE.start_main_~j~0)) (.cse2 (<= 1 ULTIMATE.start_main_~i~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~l~0 1)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse6 (<= 1 ULTIMATE.start_main_~r~0)) (.cse9 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse10 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and .cse0 .cse1 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= (div .cse7 (- 2)) .cse8) .cse9 .cse10) (let ((.cse11 (* 2 ULTIMATE.start_main_~l~0))) (and (<= .cse11 ULTIMATE.start_main_~r~0) .cse2 .cse3 .cse5 .cse9 .cse10 (<= .cse11 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))) (and .cse0 (< (div (+ .cse7 1) (- 2)) .cse8) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10))) [2021-11-02 23:07:20,525 INFO L857 garLoopResultBuilder]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,525 INFO L853 garLoopResultBuilder]: At program point L18-23(lines 17 22) the Hoare annotation is: (let ((.cse2 (<= 2 ULTIMATE.start_main_~j~0)) (.cse10 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~l~0 1)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse6 (<= 1 ULTIMATE.start_main_~r~0)) (.cse0 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse1 (+ ULTIMATE.start_main_~l~0 1)) (.cse7 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (< (div (+ .cse0 1) (- 2)) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (* 2 ULTIMATE.start_main_~l~0))) (and (<= .cse9 ULTIMATE.start_main_~r~0) .cse10 .cse3 .cse5 .cse7 (<= .cse9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))) (and .cse2 .cse10 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse3 .cse4 .cse5 .cse6 (<= (div .cse0 (- 2)) .cse1) .cse7 .cse8))) [2021-11-02 23:07:20,525 INFO L857 garLoopResultBuilder]: For program point L18-24(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,525 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,525 INFO L853 garLoopResultBuilder]: At program point L18-26(lines 17 22) the Hoare annotation is: (let ((.cse2 (<= 2 ULTIMATE.start_main_~j~0)) (.cse4 (<= ULTIMATE.start_main_~l~0 1)) (.cse6 (<= 1 ULTIMATE.start_main_~r~0)) (.cse0 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse1 (+ ULTIMATE.start_main_~l~0 1)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse7 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (< (div (+ .cse0 1) (- 2)) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse3 .cse4 .cse5 .cse6 (<= (div .cse0 (- 2)) .cse1) .cse7 .cse8) (let ((.cse9 (* 2 ULTIMATE.start_main_~l~0))) (and (<= .cse9 ULTIMATE.start_main_~r~0) .cse3 .cse5 .cse7 .cse8 (<= .cse9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))))) [2021-11-02 23:07:20,525 INFO L857 garLoopResultBuilder]: For program point L18-27(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,525 INFO L853 garLoopResultBuilder]: At program point L18-29(lines 17 22) the Hoare annotation is: (let ((.cse19 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse17 (* 2 ULTIMATE.start_main_~n~0)) (.cse12 (* 2 ULTIMATE.start_main_~l~0)) (.cse18 (div ULTIMATE.start_main_~j~0 2)) (.cse15 (div (+ .cse19 1) (- 2))) (.cse7 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse1 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse6 (div .cse19 (- 2))) (.cse3 (<= ULTIMATE.start_main_~l~0 1)) (.cse5 (<= 1 ULTIMATE.start_main_~r~0)) (.cse10 (< .cse15 .cse7)) (.cse11 (+ .cse18 1)) (.cse13 (<= .cse12 ULTIMATE.start_main_~r~0)) (.cse0 (<= 2 ULTIMATE.start_main_~j~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse14 (<= (+ .cse12 ULTIMATE.start_main_~r~0) .cse17)) (.cse4 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse9 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse16 (<= ULTIMATE.start_main_~i~0 .cse18))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 .cse7) .cse8 (<= .cse6 (+ (div (+ (- 1) ULTIMATE.start_main_~j~0) 2) 1)) .cse9) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9) (and .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (<= .cse6 .cse11) .cse2 .cse3 .cse4 .cse5 .cse8 (<= ULTIMATE.start_main_~j~0 .cse12) .cse9) (and .cse10 .cse13 .cse0 .cse2 .cse14 .cse4 (< .cse15 .cse11) .cse9 .cse16) (and .cse13 .cse0 .cse2 .cse14 .cse4 .cse8 (<= (+ ULTIMATE.start_main_~r~0 5) .cse17) .cse9 (<= .cse12 ULTIMATE.start_main_~j~0) .cse16))))) [2021-11-02 23:07:20,526 INFO L857 garLoopResultBuilder]: For program point L18-30(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,526 INFO L857 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,526 INFO L857 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,526 INFO L853 garLoopResultBuilder]: At program point L18-32(lines 17 22) the Hoare annotation is: (let ((.cse5 (* 2 ULTIMATE.start_main_~n~0)) (.cse4 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse0 (<= .cse4 ULTIMATE.start_main_~r~0)) (.cse2 (<= 2 ULTIMATE.start_main_~l~0)) (.cse3 (<= (+ .cse4 ULTIMATE.start_main_~r~0) .cse5)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse7 (<= .cse4 ULTIMATE.start_main_~j~0)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse8 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ .cse4 ULTIMATE.start_main_~r~0 1) .cse5) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse6 .cse7 .cse8) (and (let ((.cse9 (<= ULTIMATE.start_main_~r~0 .cse4))) (or (and .cse0 .cse9 .cse2 .cse3 (<= (+ ULTIMATE.start_main_~r~0 2) ULTIMATE.start_main_~j~0) .cse6 .cse7) (and .cse0 .cse9 .cse2 .cse3 (<= ULTIMATE.start_main_~j~0 .cse4) .cse6 .cse7))) .cse1 .cse8)))) [2021-11-02 23:07:20,526 INFO L857 garLoopResultBuilder]: For program point L19-2(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,526 INFO L857 garLoopResultBuilder]: For program point L18-33(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,526 INFO L857 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,527 INFO L857 garLoopResultBuilder]: For program point L19-4(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,527 INFO L853 garLoopResultBuilder]: At program point L18-35(lines 17 22) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~n~0)) (.cse2 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse0 (<= .cse2 ULTIMATE.start_main_~r~0)) (.cse1 (<= 2 ULTIMATE.start_main_~l~0)) (.cse5 (<= (+ .cse2 ULTIMATE.start_main_~r~0) (+ .cse3 2))) (.cse7 (<= .cse2 ULTIMATE.start_main_~j~0)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse8 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))) (or (and .cse0 .cse1 (<= (+ .cse2 ULTIMATE.start_main_~r~0 1) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (and (or (and .cse0 .cse1 .cse5 (<= ULTIMATE.start_main_~j~0 .cse2) .cse7) (and .cse0 .cse1 (<= (+ ULTIMATE.start_main_~r~0 2) ULTIMATE.start_main_~j~0) .cse5 .cse7)) .cse4 .cse6 .cse8)))) [2021-11-02 23:07:20,527 INFO L857 garLoopResultBuilder]: For program point L19-5(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,527 INFO L857 garLoopResultBuilder]: For program point L18-36(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,527 INFO L857 garLoopResultBuilder]: For program point L19-6(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,527 INFO L857 garLoopResultBuilder]: For program point L19-7(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,528 INFO L853 garLoopResultBuilder]: At program point L18-38(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 2 ULTIMATE.start_main_~j~0)) (.cse1 (<= (+ (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~r~0) (* 2 ULTIMATE.start_main_~n~0))) (.cse2 (<= ULTIMATE.start_main_~l~0 1)) (.cse3 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= 1 ULTIMATE.start_main_~r~0)) (.cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (div (* ULTIMATE.start_main_~r~0 (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1)) .cse5 .cse6))) [2021-11-02 23:07:20,528 INFO L857 garLoopResultBuilder]: For program point L19-8(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,528 INFO L857 garLoopResultBuilder]: For program point L18-39(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,528 INFO L857 garLoopResultBuilder]: For program point L19-9(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,528 INFO L857 garLoopResultBuilder]: For program point L19-10(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,528 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,529 INFO L853 garLoopResultBuilder]: At program point L18-41(lines 17 22) the Hoare annotation is: (let ((.cse2 (<= 2 ULTIMATE.start_main_~j~0)) (.cse8 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= (+ (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~r~0) (* 2 ULTIMATE.start_main_~n~0))) (.cse4 (<= ULTIMATE.start_main_~l~0 1)) (.cse9 (<= 1 ULTIMATE.start_main_~l~0)) (.cse5 (<= 1 ULTIMATE.start_main_~r~0)) (.cse0 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse1 (+ ULTIMATE.start_main_~l~0 1)) (.cse6 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse7 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (< (div (+ .cse0 1) (- 2)) .cse1) .cse2 .cse3 (< 0 ULTIMATE.start_main_~l~0) .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2))) (and .cse2 .cse8 .cse3 .cse4 .cse9 .cse5 (<= (div .cse0 (- 2)) .cse1) .cse6 .cse7))) [2021-11-02 23:07:20,529 INFO L857 garLoopResultBuilder]: For program point L19-11(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,529 INFO L857 garLoopResultBuilder]: For program point L19-12(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,529 INFO L857 garLoopResultBuilder]: For program point L19-13(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,529 INFO L860 garLoopResultBuilder]: At program point L69(lines 24 70) the Hoare annotation is: true [2021-11-02 23:07:20,529 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 23:07:20,529 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,530 INFO L853 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse22 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse12 (div ULTIMATE.start_main_~j~0 2)) (.cse11 (div (+ .cse22 1) (- 2))) (.cse0 (+ ULTIMATE.start_main_~l~0 1)) (.cse5 (* 2 ULTIMATE.start_main_~n~0)) (.cse23 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse1 (div ULTIMATE.start_main_~r~0 2)) (.cse13 (<= ULTIMATE.start_main_~j~0 .cse23)) (.cse14 (<= (+ .cse23 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse5 ULTIMATE.start_main_~j~0))) (.cse7 (<= .cse23 ULTIMATE.start_main_~j~0)) (.cse20 (< .cse11 .cse0)) (.cse10 (<= 1 ULTIMATE.start_main_~i~0)) (.cse9 (<= .cse23 ULTIMATE.start_main_~r~0)) (.cse21 (div .cse12 2)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse8 (<= ULTIMATE.start_main_~i~0 .cse12)) (.cse2 (<= 2 ULTIMATE.start_main_~i~0)) (.cse15 (<= 2 ULTIMATE.start_main_~j~0)) (.cse16 (<= (+ .cse23 ULTIMATE.start_main_~r~0) .cse5)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse3 (<= 1 ULTIMATE.start_main_~l~0)) (.cse18 (<= 1 ULTIMATE.start_main_~r~0)) (.cse19 (<= (div .cse22 (- 2)) .cse0)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0))) (or (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~r~0 5) .cse5) .cse6 .cse7 .cse8) (and .cse9 .cse10 (< .cse11 (+ .cse12 1)) .cse13 .cse14 .cse8) (and .cse2 .cse15 (< 0 (div (div (+ ULTIMATE.start_main_~j~0 (- 2)) 2) 2)) .cse16 .cse17 .cse3 .cse18 .cse19 .cse4 .cse6) (and .cse10 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse1) .cse13 .cse14 .cse6 .cse7 .cse8) (and .cse20 .cse15 .cse16 .cse17 .cse3 (< 0 .cse21) .cse18 .cse4 .cse6) (and (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) .cse20 .cse15 .cse10 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) .cse17 .cse3 .cse18 .cse4 .cse6) (and .cse2 .cse9 (< .cse11 (+ .cse21 1)) .cse3 .cse4 .cse6 .cse8) (and .cse2 .cse15 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse16 .cse17 .cse3 .cse18 .cse19 .cse4))))) [2021-11-02 23:07:20,530 INFO L857 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2021-11-02 23:07:20,530 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,530 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2021-11-02 23:07:20,530 INFO L857 garLoopResultBuilder]: For program point L39-1(lines 39 46) no Hoare annotation was computed. [2021-11-02 23:07:20,531 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,531 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 23:07:20,531 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,531 INFO L857 garLoopResultBuilder]: For program point L59-1(lines 24 70) no Hoare annotation was computed. [2021-11-02 23:07:20,531 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,531 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,532 INFO L857 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2021-11-02 23:07:20,532 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2021-11-02 23:07:20,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 23:07:20,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,532 INFO L857 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2021-11-02 23:07:20,533 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,533 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 23:07:20,533 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,533 INFO L857 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-11-02 23:07:20,533 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-02 23:07:20,533 INFO L857 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,534 INFO L853 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse4 (div ULTIMATE.start_main_~j~0 2)) (.cse0 (* 2 ULTIMATE.start_main_~l~0)) (.cse16 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse11 (<= 2 ULTIMATE.start_main_~i~0)) (.cse13 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse3 (div (+ .cse16 1) (- 2))) (.cse9 (+ ULTIMATE.start_main_~l~0 1)) (.cse12 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse15 (<= ULTIMATE.start_main_~l~0 1)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse10 (div ULTIMATE.start_main_~r~0 2)) (.cse5 (<= ULTIMATE.start_main_~j~0 .cse0)) (.cse2 (* 2 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse14 (<= .cse0 ULTIMATE.start_main_~j~0)) (.cse7 (<= ULTIMATE.start_main_~i~0 .cse4))) (or (and (<= .cse0 ULTIMATE.start_main_~r~0) .cse1 (<= (+ .cse0 ULTIMATE.start_main_~r~0 1) .cse2) (< .cse3 (+ .cse4 1)) .cse5 .cse6 .cse7) (and .cse8 (<= .cse9 .cse10) .cse11 .cse12 .cse13 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse6 .cse14 .cse7) (and .cse8 .cse11 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse12 .cse15 .cse13 (<= (div .cse16 (- 2)) .cse9) .cse6 .cse14) (and .cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< .cse3 .cse9) (<= 2 ULTIMATE.start_main_~j~0) .cse1 .cse12 .cse15 .cse6) (and .cse1 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse10) .cse5 (<= (+ .cse0 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse2 ULTIMATE.start_main_~j~0)) .cse6 .cse14 .cse7)))) [2021-11-02 23:07:20,534 INFO L857 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,534 INFO L853 garLoopResultBuilder]: At program point L18-5(lines 17 22) the Hoare annotation is: (let ((.cse2 (* 2 ULTIMATE.start_main_~l~0)) (.cse20 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse21 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse3 (* 2 ULTIMATE.start_main_~n~0)) (.cse10 (div ULTIMATE.start_main_~r~0 2)) (.cse8 (<= ULTIMATE.start_main_~i~0 .cse21)) (.cse4 (div (+ .cse20 1) (- 2))) (.cse0 (<= .cse2 ULTIMATE.start_main_~r~0)) (.cse9 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse5 (+ .cse21 1)) (.cse6 (<= ULTIMATE.start_main_~j~0 .cse2)) (.cse12 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse14 (<= 2 ULTIMATE.start_main_~i~0)) (.cse18 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse15 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse16 (<= 1 ULTIMATE.start_main_~l~0)) (.cse13 (+ ULTIMATE.start_main_~l~0 1)) (.cse19 (div .cse20 (- 2))) (.cse7 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse11 (<= .cse2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 (<= (+ .cse2 ULTIMATE.start_main_~r~0 1) .cse3) (< .cse4 .cse5) .cse6 .cse7 .cse8) (and .cse9 .cse1 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse10) .cse6 (<= (+ .cse2 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse3 ULTIMATE.start_main_~j~0)) .cse11 .cse8) (and .cse12 (<= .cse13 .cse10) .cse14 .cse15 .cse16 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse7 .cse11 .cse8) (and .cse12 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< .cse4 .cse13) (<= 2 ULTIMATE.start_main_~j~0) .cse1 .cse15 .cse17 .cse7) (and .cse0 .cse9 .cse18 .cse1 (<= .cse19 .cse5) .cse17 .cse16 .cse6 .cse11) (and .cse12 .cse14 .cse18 .cse15 .cse17 .cse16 (<= .cse19 .cse13) (<= .cse19 (+ (div (+ (- 1) ULTIMATE.start_main_~j~0) 2) 1)) .cse7 .cse11)))) [2021-11-02 23:07:20,534 INFO L857 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,535 INFO L853 garLoopResultBuilder]: At program point L18-8(lines 17 22) the Hoare annotation is: (let ((.cse4 (div ULTIMATE.start_main_~j~0 2)) (.cse0 (* 2 ULTIMATE.start_main_~l~0)) (.cse16 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse11 (<= 2 ULTIMATE.start_main_~i~0)) (.cse13 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse3 (div (+ .cse16 1) (- 2))) (.cse9 (+ ULTIMATE.start_main_~l~0 1)) (.cse12 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse15 (<= ULTIMATE.start_main_~l~0 1)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse10 (div ULTIMATE.start_main_~r~0 2)) (.cse5 (<= ULTIMATE.start_main_~j~0 .cse0)) (.cse2 (* 2 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse14 (<= .cse0 ULTIMATE.start_main_~j~0)) (.cse7 (<= ULTIMATE.start_main_~i~0 .cse4))) (or (and (<= .cse0 ULTIMATE.start_main_~r~0) .cse1 (<= (+ .cse0 ULTIMATE.start_main_~r~0 1) .cse2) (< .cse3 (+ .cse4 1)) .cse5 .cse6 .cse7) (and .cse8 (<= .cse9 .cse10) .cse11 .cse12 .cse13 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse6 .cse14 .cse7) (and .cse8 .cse11 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse12 .cse15 .cse13 (<= (div .cse16 (- 2)) .cse9) .cse6 .cse14) (and .cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< .cse3 .cse9) (<= 2 ULTIMATE.start_main_~j~0) .cse1 .cse12 .cse15 .cse6) (and .cse1 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse10) .cse5 (<= (+ .cse0 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse2 ULTIMATE.start_main_~j~0)) .cse6 .cse14 .cse7)))) [2021-11-02 23:07:20,535 INFO L857 garLoopResultBuilder]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,535 INFO L853 garLoopResultBuilder]: At program point L18-11(lines 17 22) the Hoare annotation is: (let ((.cse2 (* 2 ULTIMATE.start_main_~l~0)) (.cse20 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse21 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse3 (* 2 ULTIMATE.start_main_~n~0)) (.cse10 (div ULTIMATE.start_main_~r~0 2)) (.cse8 (<= ULTIMATE.start_main_~i~0 .cse21)) (.cse4 (div (+ .cse20 1) (- 2))) (.cse0 (<= .cse2 ULTIMATE.start_main_~r~0)) (.cse9 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse5 (+ .cse21 1)) (.cse6 (<= ULTIMATE.start_main_~j~0 .cse2)) (.cse12 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse14 (<= 2 ULTIMATE.start_main_~i~0)) (.cse18 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse15 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse16 (<= 1 ULTIMATE.start_main_~l~0)) (.cse13 (+ ULTIMATE.start_main_~l~0 1)) (.cse19 (div .cse20 (- 2))) (.cse7 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse11 (<= .cse2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 (<= (+ .cse2 ULTIMATE.start_main_~r~0 1) .cse3) (< .cse4 .cse5) .cse6 .cse7 .cse8) (and .cse9 .cse1 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse10) .cse6 (<= (+ .cse2 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse3 ULTIMATE.start_main_~j~0)) .cse11 .cse8) (and .cse12 (<= .cse13 .cse10) .cse14 .cse15 .cse16 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse7 .cse11 .cse8) (and .cse12 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< .cse4 .cse13) (<= 2 ULTIMATE.start_main_~j~0) .cse1 .cse15 .cse17 .cse7) (and .cse0 .cse9 .cse18 .cse1 (<= .cse19 .cse5) .cse17 .cse16 .cse6 .cse11) (and .cse12 .cse14 .cse18 .cse15 .cse17 .cse16 (<= .cse19 .cse13) (<= .cse19 (+ (div (+ (- 1) ULTIMATE.start_main_~j~0) 2) 1)) .cse7 .cse11)))) [2021-11-02 23:07:20,535 INFO L857 garLoopResultBuilder]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,536 INFO L853 garLoopResultBuilder]: At program point L18-14(lines 17 22) the Hoare annotation is: (let ((.cse8 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse7 (<= .cse8 ULTIMATE.start_main_~j~0)) (.cse4 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse5 (+ ULTIMATE.start_main_~l~0 1)) (.cse9 (<= 1 ULTIMATE.start_main_~i~0)) (.cse0 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse1 (<= ULTIMATE.start_main_~l~0 1)) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= 1 ULTIMATE.start_main_~r~0)) (.cse10 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (<= 2 ULTIMATE.start_main_~i~0) (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse0 .cse1 .cse2 .cse3 (<= (div .cse4 (- 2)) .cse5) .cse6 .cse7) (and (<= .cse8 ULTIMATE.start_main_~r~0) .cse9 .cse0 .cse2 .cse10 .cse6 .cse7 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2))) (and (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< (div (+ .cse4 1) (- 2)) .cse5) (<= 2 ULTIMATE.start_main_~j~0) .cse9 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6)))) [2021-11-02 23:07:20,536 INFO L857 garLoopResultBuilder]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2021-11-02 23:07:20,536 INFO L857 garLoopResultBuilder]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2021-11-02 23:07:20,539 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:07:20,541 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 23:07:20,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:07:20 BoogieIcfgContainer [2021-11-02 23:07:20,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 23:07:20,593 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 23:07:20,593 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 23:07:20,593 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 23:07:20,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:06:46" (3/4) ... [2021-11-02 23:07:20,597 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 23:07:20,609 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2021-11-02 23:07:20,610 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-02 23:07:20,610 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-02 23:07:20,611 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 23:07:20,665 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 23:07:20,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 23:07:20,666 INFO L168 Benchmark]: Toolchain (without parser) took 35606.65 ms. Allocated memory was 117.4 MB in the beginning and 337.6 MB in the end (delta: 220.2 MB). Free memory was 90.6 MB in the beginning and 133.9 MB in the end (delta: -43.2 MB). Peak memory consumption was 179.9 MB. Max. memory is 16.1 GB. [2021-11-02 23:07:20,667 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 81.8 MB. Free memory is still 52.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 23:07:20,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.75 ms. Allocated memory is still 117.4 MB. Free memory was 90.6 MB in the beginning and 80.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-02 23:07:20,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.01 ms. Allocated memory is still 117.4 MB. Free memory was 80.4 MB in the beginning and 78.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:07:20,668 INFO L168 Benchmark]: Boogie Preprocessor took 76.01 ms. Allocated memory is still 117.4 MB. Free memory was 78.3 MB in the beginning and 77.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:07:20,669 INFO L168 Benchmark]: RCFGBuilder took 575.13 ms. Allocated memory is still 117.4 MB. Free memory was 77.2 MB in the beginning and 64.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-02 23:07:20,669 INFO L168 Benchmark]: TraceAbstraction took 34477.67 ms. Allocated memory was 117.4 MB in the beginning and 337.6 MB in the end (delta: 220.2 MB). Free memory was 64.0 MB in the beginning and 140.2 MB in the end (delta: -76.2 MB). Peak memory consumption was 180.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:07:20,669 INFO L168 Benchmark]: Witness Printer took 72.23 ms. Allocated memory is still 337.6 MB. Free memory was 140.2 MB in the beginning and 133.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-02 23:07:20,671 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.32 ms. Allocated memory is still 81.8 MB. Free memory is still 52.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 316.75 ms. Allocated memory is still 117.4 MB. Free memory was 90.6 MB in the beginning and 80.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.01 ms. Allocated memory is still 117.4 MB. Free memory was 80.4 MB in the beginning and 78.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.01 ms. Allocated memory is still 117.4 MB. Free memory was 78.3 MB in the beginning and 77.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 575.13 ms. Allocated memory is still 117.4 MB. Free memory was 77.2 MB in the beginning and 64.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 34477.67 ms. Allocated memory was 117.4 MB in the beginning and 337.6 MB in the end (delta: 220.2 MB). Free memory was 64.0 MB in the beginning and 140.2 MB in the end (delta: -76.2 MB). Peak memory consumption was 180.1 MB. Max. memory is 16.1 GB. * Witness Printer took 72.23 ms. Allocated memory is still 337.6 MB. Free memory was 140.2 MB in the beginning and 133.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1248 SDtfs, 3609 SDslu, 2455 SDs, 0 SdLazy, 3289 SolverSat, 1438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=21, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 1672 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 292 NumberOfFragments, 2815 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1803881133 FormulaSimplificationTreeSizeReduction, 5.4s HoareSimplificationTime, 16 FomulaSimplificationsInter, 445769145 FormulaSimplificationTreeSizeReductionInter, 12.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 863 ConstructedInterpolants, 0 QuantifiedInterpolants, 4849 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1107 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 30 InterpolantComputations, 19 PerfectInterpolantSequences, 139/306 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 - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((2 * l <= r && 1 <= i) && 2 * l + r + 1 <= 2 * n) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && !(0 == cond)) && i <= j / 2) || ((((((1 <= cond && 1 <= i) && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && 2 * l <= j) && i <= j / 2)) || ((((((((j <= r && l + 1 <= r / 2) && 2 <= i) && j + 1 <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((j <= r && i + 1 <= n) && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j + 1 <= n) && l <= 1) && !(0 == cond))) || ((((((((2 * l <= r && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r * -1 / -2 <= j / 2 + 1) && l <= 1) && 1 <= l) && j <= 2 * l) && 2 * l <= j)) || (((((((((j <= r && 2 <= i) && i * -1 / -2 <= (n + -2) / 2) && j + 1 <= n) && l <= 1) && 1 <= l) && r * -1 / -2 <= l + 1) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) && 2 * l <= j) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((2 <= j && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) && i <= j / 2) || (((((((2 <= j && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((2 * l <= r && 1 <= cond) && 2 <= l) && 2 * l + r <= 2 * n) && 2 * l + r + 1 <= 2 * n) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) || (((((((((2 * l <= r && r <= 2 * l) && 2 <= l) && 2 * l + r <= 2 * n) && r + 2 <= j) && !(0 == cond)) && 2 * l <= j) || ((((((2 * l <= r && r <= 2 * l) && 2 <= l) && 2 * l + r <= 2 * n) && j <= 2 * l) && !(0 == cond)) && 2 * l <= j)) && 1 <= cond) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((2 <= i && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && !(0 == cond)) && 2 * l <= j) || (((((((2 * l <= r && 1 <= i) && j <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((((i + 1 <= n && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((l + 1 <= r / 2 && 2 <= i) && 1 <= l) && r <= n) && r + 5 <= 2 * n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) || (((((2 * l <= r && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && i <= j / 2)) || (((((((((2 <= i && 2 <= j) && 0 < (j + -2) / 2 / 2) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond))) || ((((((1 <= i && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 0 < j / 2 / 2) && 1 <= r) && r <= n) && !(0 == cond))) || (((((((((i + 1 <= n && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond))) || ((((((2 <= i && 2 * l <= r) && (r * -1 + 1) / -2 < j / 2 / 2 + 1) && 1 <= l) && r <= n) && !(0 == cond)) && i <= j / 2)) || (((((((((2 <= i && 2 <= j) && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((2 * l <= r && 1 <= i) && 2 * l + r + 1 <= 2 * n) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && !(0 == cond)) && i <= j / 2) || ((((((((j <= r && l + 1 <= r / 2) && 2 <= i) && j + 1 <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || ((((((((j <= r && 2 <= i) && i * -1 / -2 <= (n + -2) / 2) && j + 1 <= n) && l <= 1) && 1 <= l) && r * -1 / -2 <= l + 1) && !(0 == cond)) && 2 * l <= j)) || (((((((j <= r && i + 1 <= n) && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j + 1 <= n) && l <= 1) && !(0 == cond))) || ((((((1 <= i && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) || ((((((2 * l <= r && 1 <= cond) && j <= n) && 1 <= l) && r <= n) && 2 * l <= j) && i <= j / 2)) || (((((((((2 <= j && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((2 * l <= r && 2 <= l) && 2 * l + r + 1 <= 2 * n) && r <= n) && 2 * l + r <= 2 * n + 2) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) || ((((((((2 * l <= r && 2 <= l) && 2 * l + r <= 2 * n + 2) && j <= 2 * l) && 2 * l <= j) || ((((2 * l <= r && 2 <= l) && r + 2 <= j) && 2 * l + r <= 2 * n + 2) && 2 * l <= j)) && r <= n) && !(0 == cond)) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((2 <= j && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) || ((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond))) || ((((((((((2 <= j && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && r * -1 / -2 <= j / 2 + 1) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && j <= 2 * l) && !(0 == cond))) || (((((((((r * -1 + 1) / -2 < l + 1 && 2 * l <= r) && 2 <= j) && j <= n) && 2 * l + r <= 2 * n) && 1 <= l) && (r * -1 + 1) / -2 < j / 2 + 1) && !(0 == cond)) && i <= j / 2)) || (((((((((2 * l <= r && 2 <= j) && j <= n) && 2 * l + r <= 2 * n) && 1 <= l) && r <= n) && r + 5 <= 2 * n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && 2 * l + r <= 2 * n) && 0 < l) && l <= 1) && 1 <= r) && r <= n) && !(0 == cond)) || ((((((((2 <= j && 1 <= cond) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) && i <= j / 2)) || ((((((((2 <= j && 1 <= cond) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((2 * l <= r && 1 <= i) && 2 * l + r + 1 <= 2 * n) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && !(0 == cond)) && i <= j / 2) || ((((((1 <= cond && 1 <= i) && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && 2 * l <= j) && i <= j / 2)) || ((((((((j <= r && l + 1 <= r / 2) && 2 <= i) && j + 1 <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((j <= r && i + 1 <= n) && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j + 1 <= n) && l <= 1) && !(0 == cond))) || ((((((((2 * l <= r && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r * -1 / -2 <= j / 2 + 1) && l <= 1) && 1 <= l) && j <= 2 * l) && 2 * l <= j)) || (((((((((j <= r && 2 <= i) && i * -1 / -2 <= (n + -2) / 2) && j + 1 <= n) && l <= 1) && 1 <= l) && r * -1 / -2 <= l + 1) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) && 2 * l <= j) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((2 * l <= r && 1 <= i) && 2 * l + r + 1 <= 2 * n) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && !(0 == cond)) && i <= j / 2) || ((((((((j <= r && l + 1 <= r / 2) && 2 <= i) && j + 1 <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || ((((((((j <= r && 2 <= i) && i * -1 / -2 <= (n + -2) / 2) && j + 1 <= n) && l <= 1) && 1 <= l) && r * -1 / -2 <= l + 1) && !(0 == cond)) && 2 * l <= j)) || (((((((j <= r && i + 1 <= n) && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j + 1 <= n) && l <= 1) && !(0 == cond))) || ((((((1 <= i && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((2 <= i && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) && 2 * l <= j) || ((((((((((((i + 1 <= n && 2 <= j) && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r * -1 / -2 <= j / 2 + 1) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && j <= 2 * l) && !(0 == cond))) || (((((((((l + 1 <= r / 2 && 2 * l <= r) && 1 <= i) && j <= n) && 1 <= l) && r <= n) && r + 5 <= 2 * n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || ((((((((((r * -1 + 1) / -2 < l + 1 && 2 * l <= r) && 1 <= i) && j <= n) && 1 <= l) && r <= n) && 2 * l <= j) || ((((((((l + 1 <= r / 2 && 2 * l <= r) && 1 <= i) && j <= n) && 1 <= l) && r <= n) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) && 2 * l <= j)) && !(0 == cond)) && i <= j / 2)) || (((((((((i + 1 <= n && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((i + 1 <= n && 2 <= j) && i * -1 / -2 <= (n + -2) / 2) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond)) || (((((((2 * l <= r && 1 <= i) && j <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((((i + 1 <= n && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) || ((((((((2 <= j && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond))) || ((((((2 * l <= r && j <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) RESULT: Ultimate proved your program to be correct! [2021-11-02 23:07:20,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e422ad-4b19-402c-8f2f-4155177d951d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE