./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test22-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efd11941ceab8dc56d9aa56f1950f714738654ba ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:55:37,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:55:37,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:55:37,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:55:37,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:55:37,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:55:37,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:55:37,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:55:37,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:55:37,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:55:37,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:55:37,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:55:37,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:55:37,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:55:37,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:55:37,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:55:37,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:55:37,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:55:37,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:55:37,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:55:37,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:55:37,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:55:37,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:55:37,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:55:37,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:55:37,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:55:37,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:55:37,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:55:37,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:55:37,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:55:37,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:55:37,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:55:37,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:55:37,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:55:37,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:55:37,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:55:37,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:55:37,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:55:37,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:55:37,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:55:37,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:55:37,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:55:37,631 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:55:37,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:55:37,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:55:37,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:55:37,632 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:55:37,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:55:37,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:55:37,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:55:37,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:55:37,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:55:37,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:55:37,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:55:37,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:55:37,633 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:55:37,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:55:37,634 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:55:37,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:55:37,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:55:37,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:55:37,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:55:37,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:55:37,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:55:37,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:55:37,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:55:37,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:55:37,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:55:37,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:55:37,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:55:37,635 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:55:37,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer 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(__VERIFIER_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 -> efd11941ceab8dc56d9aa56f1950f714738654ba [2019-12-07 17:55:37,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:55:37,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:55:37,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:55:37,744 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:55:37,744 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:55:37,745 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/test22-1.c [2019-12-07 17:55:37,784 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/data/fd17ec9a1/f92be5f12e65443e9961b493b7f647fa/FLAGf8e378133 [2019-12-07 17:55:38,141 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:55:38,141 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/sv-benchmarks/c/ldv-regression/test22-1.c [2019-12-07 17:55:38,145 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/data/fd17ec9a1/f92be5f12e65443e9961b493b7f647fa/FLAGf8e378133 [2019-12-07 17:55:38,554 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/data/fd17ec9a1/f92be5f12e65443e9961b493b7f647fa [2019-12-07 17:55:38,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:55:38,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:55:38,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:55:38,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:55:38,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:55:38,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120ececf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38, skipping insertion in model container [2019-12-07 17:55:38,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:55:38,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:55:38,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:55:38,695 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:55:38,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:55:38,748 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:55:38,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38 WrapperNode [2019-12-07 17:55:38,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:55:38,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:55:38,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:55:38,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:55:38,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:55:38,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:55:38,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:55:38,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:55:38,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... [2019-12-07 17:55:38,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:55:38,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:55:38,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:55:38,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:55:38,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:55:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 17:55:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:55:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:55:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:55:38,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:55:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:55:38,986 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:55:38,986 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-12-07 17:55:38,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:38 BoogieIcfgContainer [2019-12-07 17:55:38,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:55:38,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:55:38,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:55:38,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:55:38,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:55:38" (1/3) ... [2019-12-07 17:55:38,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7717bfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:55:38, skipping insertion in model container [2019-12-07 17:55:38,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:38" (2/3) ... [2019-12-07 17:55:38,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7717bfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:55:38, skipping insertion in model container [2019-12-07 17:55:38,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:38" (3/3) ... [2019-12-07 17:55:38,992 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-1.c [2019-12-07 17:55:38,998 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:55:39,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:55:39,009 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:55:39,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:55:39,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:55:39,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:55:39,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:55:39,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:55:39,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:55:39,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:55:39,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:55:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-12-07 17:55:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:55:39,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:39,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:39,039 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash 164664103, now seen corresponding path program 1 times [2019-12-07 17:55:39,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:39,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201267279] [2019-12-07 17:55:39,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:39,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201267279] [2019-12-07 17:55:39,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:39,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:39,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297962818] [2019-12-07 17:55:39,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:55:39,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:39,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:55:39,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:55:39,179 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-12-07 17:55:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:39,190 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-12-07 17:55:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:55:39,191 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-12-07 17:55:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:39,197 INFO L225 Difference]: With dead ends: 34 [2019-12-07 17:55:39,197 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 17:55:39,199 INFO L630 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 [2019-12-07 17:55:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 17:55:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 17:55:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 17:55:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-12-07 17:55:39,220 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 19 [2019-12-07 17:55:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:39,220 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-12-07 17:55:39,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:55:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-12-07 17:55:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:55:39,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:39,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:39,221 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash 603612068, now seen corresponding path program 1 times [2019-12-07 17:55:39,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:39,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261393844] [2019-12-07 17:55:39,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:39,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261393844] [2019-12-07 17:55:39,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:39,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:55:39,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86056657] [2019-12-07 17:55:39,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:55:39,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:39,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:55:39,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:55:39,388 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-12-07 17:55:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:39,697 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-12-07 17:55:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:55:39,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 17:55:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:39,699 INFO L225 Difference]: With dead ends: 96 [2019-12-07 17:55:39,699 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 17:55:39,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:55:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 17:55:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 33. [2019-12-07 17:55:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 17:55:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-12-07 17:55:39,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2019-12-07 17:55:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:39,707 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-12-07 17:55:39,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:55:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-12-07 17:55:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:55:39,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:39,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:39,708 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash -407505182, now seen corresponding path program 1 times [2019-12-07 17:55:39,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:39,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196719507] [2019-12-07 17:55:39,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:39,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196719507] [2019-12-07 17:55:39,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:39,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:55:39,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465553658] [2019-12-07 17:55:39,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:55:39,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:39,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:55:39,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:55:39,775 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 10 states. [2019-12-07 17:55:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:40,020 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-12-07 17:55:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:55:40,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 17:55:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:40,022 INFO L225 Difference]: With dead ends: 91 [2019-12-07 17:55:40,022 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 17:55:40,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:55:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 17:55:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2019-12-07 17:55:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 17:55:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-12-07 17:55:40,030 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-12-07 17:55:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:40,030 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-12-07 17:55:40,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:55:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-12-07 17:55:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:55:40,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:40,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:40,032 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:40,032 INFO L82 PathProgramCache]: Analyzing trace with hash -984735834, now seen corresponding path program 1 times [2019-12-07 17:55:40,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:40,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979497202] [2019-12-07 17:55:40,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:40,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979497202] [2019-12-07 17:55:40,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:40,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:55:40,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318344617] [2019-12-07 17:55:40,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:55:40,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:55:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:55:40,102 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-12-07 17:55:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:40,331 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-12-07 17:55:40,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:55:40,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 17:55:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:40,332 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:55:40,332 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 17:55:40,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:55:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 17:55:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2019-12-07 17:55:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 17:55:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-12-07 17:55:40,337 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2019-12-07 17:55:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:40,337 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-12-07 17:55:40,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:55:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-12-07 17:55:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:55:40,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:40,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:40,338 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1995853084, now seen corresponding path program 1 times [2019-12-07 17:55:40,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:40,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009020386] [2019-12-07 17:55:40,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:40,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009020386] [2019-12-07 17:55:40,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:40,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:55:40,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738007687] [2019-12-07 17:55:40,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:55:40,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:40,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:55:40,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:55:40,424 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2019-12-07 17:55:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:40,693 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-12-07 17:55:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:55:40,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 17:55:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:40,695 INFO L225 Difference]: With dead ends: 73 [2019-12-07 17:55:40,695 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 17:55:40,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:55:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 17:55:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 26. [2019-12-07 17:55:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 17:55:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-12-07 17:55:40,701 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2019-12-07 17:55:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:40,701 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-12-07 17:55:40,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:55:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-12-07 17:55:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:55:40,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:40,701 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:40,702 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1760411593, now seen corresponding path program 1 times [2019-12-07 17:55:40,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:40,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912224190] [2019-12-07 17:55:40,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:40,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912224190] [2019-12-07 17:55:40,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575236084] [2019-12-07 17:55:40,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:40,869 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 17:55:40,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:55:41,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:55:41,094 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:55:41,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:55:41,097 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:55:41,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:55:41,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:55:41,106 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-12-07 17:55:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:41,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:55:41,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-12-07 17:55:41,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484577735] [2019-12-07 17:55:41,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 17:55:41,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:41,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:55:41,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:55:41,109 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 22 states. [2019-12-07 17:55:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:41,724 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-12-07 17:55:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:55:41,724 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-12-07 17:55:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:41,725 INFO L225 Difference]: With dead ends: 77 [2019-12-07 17:55:41,725 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 17:55:41,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 17:55:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 17:55:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2019-12-07 17:55:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 17:55:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-12-07 17:55:41,731 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2019-12-07 17:55:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:41,731 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-12-07 17:55:41,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 17:55:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-12-07 17:55:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:55:41,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:41,732 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:41,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:41,933 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash -949600503, now seen corresponding path program 1 times [2019-12-07 17:55:41,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:41,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248330431] [2019-12-07 17:55:41,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:42,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248330431] [2019-12-07 17:55:42,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645444725] [2019-12-07 17:55:42,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:42,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 17:55:42,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:42,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:55:42,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:55:42,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:55:42,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:55:42,281 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:55:42,287 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:55:42,288 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:55:42,288 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-12-07 17:55:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:42,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:55:42,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-12-07 17:55:42,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123240426] [2019-12-07 17:55:42,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 17:55:42,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:42,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:55:42,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:55:42,291 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 22 states. [2019-12-07 17:55:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:43,029 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-12-07 17:55:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:55:43,030 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-12-07 17:55:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:43,030 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:55:43,031 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 17:55:43,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 17:55:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 17:55:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 28. [2019-12-07 17:55:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 17:55:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-12-07 17:55:43,035 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-12-07 17:55:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:43,035 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-12-07 17:55:43,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 17:55:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-12-07 17:55:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:55:43,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:43,036 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:43,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:43,237 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:43,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1048225454, now seen corresponding path program 2 times [2019-12-07 17:55:43,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:43,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294005630] [2019-12-07 17:55:43,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:43,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294005630] [2019-12-07 17:55:43,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815045338] [2019-12-07 17:55:43,382 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:43,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:55:43,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:55:43,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 17:55:43,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:43,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:55:43,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:55:43,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:55:43,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:55:43,609 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:55:43,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:55:43,616 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:55:43,616 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-12-07 17:55:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:43,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:55:43,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-12-07 17:55:43,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334164205] [2019-12-07 17:55:43,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 17:55:43,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:43,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 17:55:43,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:55:43,619 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 24 states. [2019-12-07 17:55:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:44,471 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-12-07 17:55:44,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:55:44,471 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-12-07 17:55:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:44,472 INFO L225 Difference]: With dead ends: 85 [2019-12-07 17:55:44,472 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 17:55:44,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 17:55:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 17:55:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 37. [2019-12-07 17:55:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 17:55:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-12-07 17:55:44,477 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2019-12-07 17:55:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:44,477 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-12-07 17:55:44,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 17:55:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-12-07 17:55:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:55:44,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:44,478 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:44,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:44,679 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:44,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:44,679 INFO L82 PathProgramCache]: Analyzing trace with hash -523217426, now seen corresponding path program 2 times [2019-12-07 17:55:44,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:44,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333754623] [2019-12-07 17:55:44,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:44,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333754623] [2019-12-07 17:55:44,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558936885] [2019-12-07 17:55:44,832 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:44,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:55:44,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:55:44,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 17:55:44,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:55:45,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:55:45,047 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:55:45,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:55:45,050 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:55:45,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:55:45,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:55:45,057 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-12-07 17:55:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:45,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:55:45,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-12-07 17:55:45,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304164360] [2019-12-07 17:55:45,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 17:55:45,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 17:55:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:55:45,060 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 24 states. [2019-12-07 17:55:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:45,966 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-12-07 17:55:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:55:45,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-12-07 17:55:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:45,968 INFO L225 Difference]: With dead ends: 89 [2019-12-07 17:55:45,968 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 17:55:45,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 17:55:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 17:55:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 30. [2019-12-07 17:55:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 17:55:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-12-07 17:55:45,979 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2019-12-07 17:55:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:45,980 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-12-07 17:55:45,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 17:55:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-12-07 17:55:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:55:45,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:45,982 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:46,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:46,184 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:46,184 INFO L82 PathProgramCache]: Analyzing trace with hash -462854061, now seen corresponding path program 3 times [2019-12-07 17:55:46,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:46,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17519274] [2019-12-07 17:55:46,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:46,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17519274] [2019-12-07 17:55:46,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722458530] [2019-12-07 17:55:46,358 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:46,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 17:55:46,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:55:46,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 17:55:46,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:55:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:55:46,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:55:46,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-12-07 17:55:46,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856091348] [2019-12-07 17:55:46,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 17:55:46,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 17:55:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:55:46,697 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-12-07 17:55:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:49,555 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-12-07 17:55:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 17:55:49,555 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-12-07 17:55:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:49,556 INFO L225 Difference]: With dead ends: 89 [2019-12-07 17:55:49,556 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 17:55:49,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=866, Invalid=3690, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 17:55:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 17:55:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-12-07 17:55:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 17:55:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-12-07 17:55:49,567 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2019-12-07 17:55:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:49,567 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-12-07 17:55:49,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 17:55:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-12-07 17:55:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:55:49,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:49,569 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:49,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:49,770 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1209026451, now seen corresponding path program 3 times [2019-12-07 17:55:49,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:49,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777584277] [2019-12-07 17:55:49,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:49,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777584277] [2019-12-07 17:55:49,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50622228] [2019-12-07 17:55:49,920 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:49,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 17:55:49,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:55:49,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 17:55:49,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:50,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:55:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:55:50,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:55:50,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-12-07 17:55:50,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206374476] [2019-12-07 17:55:50,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 17:55:50,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 17:55:50,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:55:50,246 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 30 states. [2019-12-07 17:55:51,666 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-12-07 17:55:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:52,610 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-12-07 17:55:52,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 17:55:52,610 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-12-07 17:55:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:52,610 INFO L225 Difference]: With dead ends: 49 [2019-12-07 17:55:52,610 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:55:52,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=804, Invalid=3356, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 17:55:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:55:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:55:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:55:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:55:52,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-12-07 17:55:52,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:52,612 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:55:52,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 17:55:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:55:52,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:55:52,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:52,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:55:53,302 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 155 [2019-12-07 17:55:53,654 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 27 [2019-12-07 17:55:54,479 WARN L192 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 33 [2019-12-07 17:55:54,502 INFO L246 CegarLoopResult]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2019-12-07 17:55:54,502 INFO L246 CegarLoopResult]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2019-12-07 17:55:54,503 INFO L242 CegarLoopResult]: At program point L27(lines 25 28) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) ULTIMATE.start_main_~pd2~0.offset))) (let ((.cse5 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse0 (<= .cse10 ULTIMATE.start_main_~i~0)) (.cse3 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse1 (not (= 0 ULTIMATE.start_main_~pd2~0.base))) (.cse2 (<= ULTIMATE.start_main_~i~0 .cse10)) (.cse6 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse7 (= 0 |~#d1~0.offset|)) (.cse4 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse8 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset)) (.cse9 (= 1 |ULTIMATE.start_check_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse6 (= 0 ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse8 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse9) (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse5 .cse0 .cse3 .cse1 .cse2 .cse6 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse4 .cse8 .cse9)))) [2019-12-07 17:55:54,503 INFO L246 CegarLoopResult]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-12-07 17:55:54,503 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:55:54,503 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:55:54,503 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:55:54,503 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-12-07 17:55:54,503 INFO L249 CegarLoopResult]: At program point L49(lines 30 50) the Hoare annotation is: true [2019-12-07 17:55:54,503 INFO L246 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-12-07 17:55:54,503 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:55:54,503 INFO L242 CegarLoopResult]: At program point L42(lines 31 50) the Hoare annotation is: false [2019-12-07 17:55:54,504 INFO L246 CegarLoopResult]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2019-12-07 17:55:54,504 INFO L242 CegarLoopResult]: At program point L38-3(lines 38 40) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse1 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse2 (not (= 0 ULTIMATE.start_main_~pd2~0.base))) (.cse3 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse4 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse6 (= 0 |~#d1~0.offset|)) (.cse5 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse7 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and .cse0 (= 0 |~#d2~0.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_main_~pd1~0.offset) .cse6 .cse7 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)) (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse6 .cse5 .cse7))) [2019-12-07 17:55:54,504 INFO L246 CegarLoopResult]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2019-12-07 17:55:54,504 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-12-07 17:55:54,504 INFO L246 CegarLoopResult]: For program point L22-2(line 22) no Hoare annotation was computed. [2019-12-07 17:55:54,504 INFO L242 CegarLoopResult]: At program point L22-3(lines 20 23) the Hoare annotation is: (let ((.cse0 (= 0 |~#d1~0.offset|)) (.cse1 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (or (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) (= 0 |~#d2~0.offset|) .cse0 (not .cse1)) (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) .cse0 .cse1))) [2019-12-07 17:55:54,504 INFO L246 CegarLoopResult]: For program point L22-4(line 22) no Hoare annotation was computed. [2019-12-07 17:55:54,504 INFO L246 CegarLoopResult]: For program point L22-6(line 22) no Hoare annotation was computed. [2019-12-07 17:55:54,505 INFO L242 CegarLoopResult]: At program point L22-7(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and (or (and .cse0 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|)) (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) (not (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|)))) (= |ULTIMATE.start_get_dummy_#res.offset| ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|) (= 0 ULTIMATE.start_main_~pd1~0.offset)) (and (not (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) .cse0))) [2019-12-07 17:55:54,505 INFO L246 CegarLoopResult]: For program point L22-8(line 22) no Hoare annotation was computed. [2019-12-07 17:55:54,505 INFO L246 CegarLoopResult]: For program point L22-10(line 22) no Hoare annotation was computed. [2019-12-07 17:55:54,505 INFO L242 CegarLoopResult]: At program point L22-11(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse0 (not (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base))) (and (let ((.cse2 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse1 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (or (and .cse1 .cse0 .cse2) (and (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse2 (not .cse1) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)))) (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|)))) [2019-12-07 17:55:54,505 INFO L246 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2019-12-07 17:55:54,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:55:54 BoogieIcfgContainer [2019-12-07 17:55:54,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:55:54,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:55:54,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:55:54,532 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:55:54,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:38" (3/4) ... [2019-12-07 17:55:54,535 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:55:54,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 17:55:54,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:55:54,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:55:54,560 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((d2 == \result && \result == d2) && 0 == d2) && 0 == d1) && !(d1 == \result)) || (((!(d1 == d2) && d1 == \result) && 0 == d1) && d1 == \result) [2019-12-07 17:55:54,561 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(d1 == d2) && d1 == \result) || ((d2 == \result && pd1 == d2) && !(pd1 == d1))) && \result == pd1) && 0 == d1) && 0 == pd1) || (!(pd1 == \result) && !(d1 == d2)) [2019-12-07 17:55:54,561 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((unknown-#memory_int-unknown[pd2][pd2] <= i && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && !(d1 == d2)) && pd2 == pa) && pd1 == pd2) && d2 == pd1) && pd2 == pd1) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) && 1 == \result) || (((((((((((pd1 == d1 && pd1 == pd2) && unknown-#memory_int-unknown[pd2][pd2] <= i) && !(d1 == d2)) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) && 1 == \result) [2019-12-07 17:55:54,577 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a31f4483-7e49-4a38-bd94-2867b45703c5/bin/uautomizer/witness.graphml [2019-12-07 17:55:54,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:55:54,578 INFO L168 Benchmark]: Toolchain (without parser) took 16021.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 250.6 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:54,579 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:55:54,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:54,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:55:54,579 INFO L168 Benchmark]: Boogie Preprocessor took 17.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:55:54,579 INFO L168 Benchmark]: RCFGBuilder took 194.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:54,580 INFO L168 Benchmark]: TraceAbstraction took 15544.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.3 MB). Peak memory consumption was 404.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:54,580 INFO L168 Benchmark]: Witness Printer took 45.40 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:54,581 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 194.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15544.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.3 MB). Peak memory consumption was 404.2 MB. Max. memory is 11.5 GB. * Witness Printer took 45.40 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((!(d1 == d2) && d1 == \result) || ((d2 == \result && pd1 == d2) && !(pd1 == d1))) && \result == pd1) && 0 == d1) && 0 == pd1) || (!(pd1 == \result) && !(d1 == d2)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (!(d1 == d2) && !(pd1 == pd2)) || (((((pd1 == d1 && !(d1 == d2)) && pd2 == pd1) || (((d2 == pd1 && pd2 == pd1) && !(pd1 == d1)) && pd1 == d2)) && d1 == pd1) && 0 == d1) - InvariantResult [Line: 25]: Loop Invariant [2019-12-07 17:55:54,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,588 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,588 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,589 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,589 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((((unknown-#memory_int-unknown[pd2][pd2] <= i && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && !(d1 == d2)) && pd2 == pa) && pd1 == pd2) && d2 == pd1) && pd2 == pd1) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) && 1 == \result) || (((((((((((pd1 == d1 && pd1 == pd2) && unknown-#memory_int-unknown[pd2][pd2] <= i) && !(d1 == d2)) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) && 1 == \result) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((d2 == \result && \result == d2) && 0 == d2) && 0 == d1) && !(d1 == \result)) || (((!(d1 == d2) && d1 == \result) && 0 == d1) && d1 == \result) - InvariantResult [Line: 38]: Loop Invariant [2019-12-07 17:55:54,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:55:54,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((pd1 == pd2 && 0 == d2) && i <= unknown-#memory_int-unknown[pa][pa]) && !(0 == pd2)) && !(d1 == d2)) && pd2 == pd1) && pd2 == pa) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) || (((((((((pd1 == d1 && pd1 == pd2) && i <= unknown-#memory_int-unknown[pa][pa]) && !(0 == pd2)) && !(d1 == d2)) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 13.7s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 276 SDtfs, 1048 SDslu, 2027 SDs, 0 SdLazy, 3238 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 363 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 43 NumberOfFragments, 293 HoareAnnotationTreeSize, 7 FomulaSimplifications, 6766116 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 573071 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 387 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 53785 SizeOfPredicates, 70 NumberOfNonLiveVariables, 764 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 18/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...