./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/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 308e43cca528a064aecd41d099b341627e43bb71 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:01:40,691 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:01:40,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:01:40,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:01:40,699 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:01:40,700 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:01:40,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:01:40,702 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:01:40,703 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:01:40,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:01:40,704 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:01:40,704 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:01:40,705 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:01:40,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:01:40,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:01:40,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:01:40,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:01:40,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:01:40,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:01:40,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:01:40,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:01:40,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:01:40,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:01:40,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:01:40,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:01:40,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:01:40,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:01:40,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:01:40,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:01:40,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:01:40,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:01:40,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:01:40,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:01:40,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:01:40,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:01:40,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:01:40,720 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:01:40,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:01:40,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:01:40,730 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:01:40,730 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:01:40,731 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:01:40,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:01:40,731 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:01:40,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:01:40,732 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:01:40,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:01:40,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:01:40,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:01:40,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:01:40,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:01:40,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:01:40,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:01:40,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:01:40,733 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:01:40,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:01:40,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:01:40,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:01:40,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:01:40,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:01:40,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:01:40,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:01:40,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:01:40,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:01:40,734 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:01:40,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:01:40,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:01:40,734 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/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 -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-11-23 00:01:40,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:01:40,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:01:40,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:01:40,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:01:40,768 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:01:40,768 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-23 00:01:40,805 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/data/a0433f62c/89db8980e4dd437283f5c620c13485d7/FLAG03595fcdd [2018-11-23 00:01:41,128 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:01:41,129 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-23 00:01:41,133 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/data/a0433f62c/89db8980e4dd437283f5c620c13485d7/FLAG03595fcdd [2018-11-23 00:01:41,144 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/data/a0433f62c/89db8980e4dd437283f5c620c13485d7 [2018-11-23 00:01:41,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:01:41,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:01:41,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:01:41,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:01:41,150 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:01:41,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5e9553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41, skipping insertion in model container [2018-11-23 00:01:41,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:01:41,172 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:01:41,301 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:01:41,311 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:01:41,325 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:01:41,341 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:01:41,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41 WrapperNode [2018-11-23 00:01:41,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:01:41,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:01:41,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:01:41,342 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:01:41,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:01:41,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:01:41,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:01:41,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:01:41,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... [2018-11-23 00:01:41,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:01:41,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:01:41,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:01:41,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:01:41,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/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 [2018-11-23 00:01:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-23 00:01:41,463 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-23 00:01:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:01:41,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:01:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 00:01:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 00:01:41,463 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 00:01:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:01:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:01:41,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:01:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:01:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-23 00:01:41,464 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-23 00:01:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:01:41,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:01:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:01:41,623 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:01:41,624 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:01:41,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:41 BoogieIcfgContainer [2018-11-23 00:01:41,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:01:41,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:01:41,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:01:41,627 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:01:41,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:01:41" (1/3) ... [2018-11-23 00:01:41,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3a4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:41, skipping insertion in model container [2018-11-23 00:01:41,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:41" (2/3) ... [2018-11-23 00:01:41,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3a4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:41, skipping insertion in model container [2018-11-23 00:01:41,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:41" (3/3) ... [2018-11-23 00:01:41,630 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-11-23 00:01:41,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:01:41,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:01:41,649 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:01:41,669 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:01:41,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:01:41,670 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:01:41,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:01:41,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:01:41,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:01:41,670 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:01:41,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:01:41,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:01:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 00:01:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:01:41,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:41,691 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:41,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:41,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:41,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1787337799, now seen corresponding path program 1 times [2018-11-23 00:01:41,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:41,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:41,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:41,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:41,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:01:41,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:01:41,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:01:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:01:41,843 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 00:01:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:41,856 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 00:01:41,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:01:41,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-23 00:01:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:41,864 INFO L225 Difference]: With dead ends: 46 [2018-11-23 00:01:41,864 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 00:01:41,866 INFO L631 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 [2018-11-23 00:01:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 00:01:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 00:01:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 00:01:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 00:01:41,895 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2018-11-23 00:01:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:41,896 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 00:01:41,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:01:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 00:01:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 00:01:41,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:41,898 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:41,898 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:41,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1425990092, now seen corresponding path program 1 times [2018-11-23 00:01:41,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:41,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:41,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:42,517 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 27 [2018-11-23 00:01:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:42,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:42,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 00:01:42,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:01:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:01:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:01:42,595 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-23 00:01:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:42,966 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-23 00:01:42,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:01:42,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 00:01:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:42,970 INFO L225 Difference]: With dead ends: 54 [2018-11-23 00:01:42,970 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 00:01:42,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-23 00:01:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 00:01:42,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-11-23 00:01:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 00:01:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-23 00:01:42,980 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2018-11-23 00:01:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:42,980 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-23 00:01:42,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:01:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 00:01:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 00:01:42,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:42,982 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:42,982 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:42,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1848691918, now seen corresponding path program 1 times [2018-11-23 00:01:42,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:42,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:42,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:42,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:01:43,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:43,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:43,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:43,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:43,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 00:01:43,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 00:01:43,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:43,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:43,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:43,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 00:01:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:01:43,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:43,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-23 00:01:43,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 00:01:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 00:01:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:01:43,208 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-11-23 00:01:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:43,365 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-23 00:01:43,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:01:43,366 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-23 00:01:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:43,367 INFO L225 Difference]: With dead ends: 56 [2018-11-23 00:01:43,367 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 00:01:43,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-23 00:01:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 00:01:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-23 00:01:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 00:01:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 00:01:43,376 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-11-23 00:01:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:43,376 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 00:01:43,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 00:01:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 00:01:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 00:01:43,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:43,378 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:43,378 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:43,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:43,378 INFO L82 PathProgramCache]: Analyzing trace with hash 568828240, now seen corresponding path program 1 times [2018-11-23 00:01:43,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:43,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:43,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:43,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:43,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:43,919 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 31 [2018-11-23 00:01:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:43,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:43,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 00:01:43,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:01:43,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:01:43,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:01:43,961 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2018-11-23 00:01:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:44,295 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 00:01:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:01:44,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 00:01:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:44,296 INFO L225 Difference]: With dead ends: 54 [2018-11-23 00:01:44,296 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 00:01:44,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-23 00:01:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 00:01:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-23 00:01:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 00:01:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 00:01:44,302 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2018-11-23 00:01:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:44,302 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 00:01:44,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:01:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 00:01:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 00:01:44,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:44,303 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:44,303 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:44,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:44,304 INFO L82 PathProgramCache]: Analyzing trace with hash -957154489, now seen corresponding path program 1 times [2018-11-23 00:01:44,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:44,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:44,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:44,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:44,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:44,739 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 37 [2018-11-23 00:01:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:44,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:44,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:44,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:44,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:45,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 00:01:45,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 00:01:45,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:45,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:45,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:01:45,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-23 00:01:45,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 00:01:45,141 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:01:45,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-23 00:01:45,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:45,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:45,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:45,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-23 00:01:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:01:45,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:45,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-23 00:01:45,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 00:01:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 00:01:45,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-11-23 00:01:45,191 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 23 states. [2018-11-23 00:01:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:45,736 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-23 00:01:45,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 00:01:45,736 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-23 00:01:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:45,737 INFO L225 Difference]: With dead ends: 60 [2018-11-23 00:01:45,737 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 00:01:45,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=1125, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 00:01:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 00:01:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2018-11-23 00:01:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 00:01:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 00:01:45,743 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-11-23 00:01:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:45,743 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 00:01:45,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 00:01:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 00:01:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 00:01:45,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:45,744 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:45,744 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:45,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash -55973429, now seen corresponding path program 1 times [2018-11-23 00:01:45,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:45,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:45,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:45,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:45,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:46,231 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 30 [2018-11-23 00:01:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:46,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:46,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:46,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:46,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:46,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 00:01:46,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 00:01:46,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:46,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:46,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:01:46,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-11-23 00:01:46,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-23 00:01:46,638 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:01:46,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-23 00:01:46,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:46,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:46,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:46,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:5 [2018-11-23 00:01:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:01:46,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:46,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-23 00:01:46,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 00:01:46,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 00:01:46,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-11-23 00:01:46,677 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 23 states. [2018-11-23 00:01:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:47,351 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-23 00:01:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 00:01:47,351 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-23 00:01:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:47,352 INFO L225 Difference]: With dead ends: 62 [2018-11-23 00:01:47,352 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 00:01:47,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=1125, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 00:01:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 00:01:47,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-23 00:01:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 00:01:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 00:01:47,360 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2018-11-23 00:01:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:47,360 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 00:01:47,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 00:01:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 00:01:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 00:01:47,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:47,361 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:47,362 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:47,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1263240701, now seen corresponding path program 2 times [2018-11-23 00:01:47,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:47,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:47,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:47,884 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 44 [2018-11-23 00:01:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:48,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:48,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:01:48,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:01:48,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:01:48,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:48,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 00:01:48,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 00:01:48,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:48,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:48,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:01:48,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-23 00:01:48,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-23 00:01:48,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-11-23 00:01:48,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:48,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:48,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:48,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:9 [2018-11-23 00:01:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:01:48,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:48,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12] total 32 [2018-11-23 00:01:48,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 00:01:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 00:01:48,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2018-11-23 00:01:48,771 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 32 states. [2018-11-23 00:01:49,339 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-11-23 00:01:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:50,693 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-11-23 00:01:50,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 00:01:50,693 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2018-11-23 00:01:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:50,694 INFO L225 Difference]: With dead ends: 84 [2018-11-23 00:01:50,694 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 00:01:50,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=643, Invalid=3389, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 00:01:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 00:01:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-23 00:01:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 00:01:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 00:01:50,718 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 37 [2018-11-23 00:01:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:50,719 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 00:01:50,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 00:01:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 00:01:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 00:01:50,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:50,721 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:50,721 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:50,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash -685796735, now seen corresponding path program 2 times [2018-11-23 00:01:50,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:50,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:50,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:50,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:01:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:51,086 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 39 [2018-11-23 00:01:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:51,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:51,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:01:51,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:01:51,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:01:51,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:51,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:01:51,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:01:51,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:51,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:51,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:51,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-11-23 00:01:51,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-23 00:01:51,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-23 00:01:51,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:01:51,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:01:51,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:51,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:5 [2018-11-23 00:01:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:01:51,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:51,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2018-11-23 00:01:51,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 00:01:51,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 00:01:51,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-11-23 00:01:51,733 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 26 states. [2018-11-23 00:01:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:53,355 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 00:01:53,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 00:01:53,355 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-11-23 00:01:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:53,356 INFO L225 Difference]: With dead ends: 101 [2018-11-23 00:01:53,356 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 00:01:53,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=734, Invalid=3172, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 00:01:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 00:01:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 47. [2018-11-23 00:01:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 00:01:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 00:01:53,367 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2018-11-23 00:01:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:53,367 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 00:01:53,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 00:01:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 00:01:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 00:01:53,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:53,368 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:53,368 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:53,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:53,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2133408361, now seen corresponding path program 3 times [2018-11-23 00:01:53,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:53,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:53,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:01:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:54,107 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 29 [2018-11-23 00:01:54,228 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 39 [2018-11-23 00:01:54,351 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 43 [2018-11-23 00:01:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:54,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:54,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:54,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:01:54,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 00:01:54,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:01:54,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:55,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 00:01:55,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 00:01:55,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:01:55,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:01:55,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:01:55,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-11-23 00:02:09,116 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 00:02:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 00:02:09,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:02:09,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2018-11-23 00:02:09,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 00:02:09,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 00:02:09,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1234, Unknown=6, NotChecked=0, Total=1332 [2018-11-23 00:02:09,198 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 37 states. [2018-11-23 00:02:22,868 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2018-11-23 00:02:25,574 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 00:02:27,470 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 54 [2018-11-23 00:02:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:02:28,989 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 00:02:28,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-23 00:02:28,989 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 45 [2018-11-23 00:02:28,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:02:28,989 INFO L225 Difference]: With dead ends: 80 [2018-11-23 00:02:28,989 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 00:02:28,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=1372, Invalid=7175, Unknown=9, NotChecked=0, Total=8556 [2018-11-23 00:02:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 00:02:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 00:02:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 00:02:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 00:02:28,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-11-23 00:02:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:02:28,991 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:02:28,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 00:02:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:02:28,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 00:02:28,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 00:02:29,367 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 309 [2018-11-23 00:02:33,499 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2018-11-23 00:02:33,925 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2018-11-23 00:02:34,448 WARN L180 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2018-11-23 00:02:38,489 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2018-11-23 00:02:38,671 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2018-11-23 00:02:39,362 WARN L180 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 45 [2018-11-23 00:02:39,364 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 12 19) no Hoare annotation was computed. [2018-11-23 00:02:39,364 INFO L444 ceAbstractionStarter]: At program point initENTRY(lines 12 19) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|) (and (exists ((v_main_~i~0_22 Int) (v_main_~pd2~0.base_BEFORE_CALL_1 Int) (v_main_~pd2~0.offset_BEFORE_CALL_1 Int)) (and (<= 0 v_main_~pd2~0.offset_BEFORE_CALL_1) (= v_main_~i~0_22 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (+ (* 4 v_main_~i~0_22) v_main_~pd2~0.offset_BEFORE_CALL_1 8))) (<= v_main_~pd2~0.offset_BEFORE_CALL_1 0))) (= |#memory_int| |old(#memory_int)|))) [2018-11-23 00:02:39,364 INFO L448 ceAbstractionStarter]: For program point initFINAL(lines 12 19) no Hoare annotation was computed. [2018-11-23 00:02:39,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:02:39,364 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:02:39,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:02:39,364 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 21 24) no Hoare annotation was computed. [2018-11-23 00:02:39,364 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 21 24) the Hoare annotation is: true [2018-11-23 00:02:39,364 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-23 00:02:39,364 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 21 24) no Hoare annotation was computed. [2018-11-23 00:02:39,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:02:39,365 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|))) (and (not (= |~#d2~0.base| |~#d1~0.base|)) (= (select (select |#memory_int| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0) (= 0 |~#d1~0.offset|) (<= .cse0 0) (<= 0 .cse0))) [2018-11-23 00:02:39,365 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:02:39,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:02:39,365 INFO L444 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse1 (+ |~#d1~0.offset| 8))) (let ((.cse0 (select (select |old(#memory_int)| |~#d1~0.base|) .cse1))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse0 0)) (= .cse0 (select (select |#memory_int| |~#d1~0.base|) .cse1)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|)))) [2018-11-23 00:02:39,365 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2018-11-23 00:02:39,365 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 31 52) no Hoare annotation was computed. [2018-11-23 00:02:39,365 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 31 52) no Hoare annotation was computed. [2018-11-23 00:02:39,365 INFO L444 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (< 0 |~#d2~0.offset|) (< |~#d1~0.offset| |~#d2~0.offset|) (< (* 5 |~#d2~0.offset|) |~#d1~0.offset|)) [2018-11-23 00:02:39,365 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-11-23 00:02:39,365 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (or (and (exists ((v_main_~i~0_22 Int)) (let ((.cse1 (* 4 v_main_~i~0_22))) (let ((.cse0 (+ main_~pd2~0.offset .cse1 8))) (and (= v_main_~i~0_22 (select (select |#memory_int| main_~pa~0.base) .cse0)) (<= .cse0 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse1 8)))))) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (<= main_~pd1~0.offset |~#d1~0.offset|) (<= 0 main_~pd2~0.offset) (= main_~pd2~0.base main_~pa~0.base)) (< |~#d2~0.offset| |~#d1~0.offset|) (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (not (= 0 |~#d1~0.offset|)) (< 0 |~#d2~0.offset|)) [2018-11-23 00:02:39,365 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2018-11-23 00:02:39,365 INFO L444 ceAbstractionStarter]: At program point L40-4(lines 40 42) the Hoare annotation is: (let ((.cse1 (+ |~#d1~0.offset| 8))) (let ((.cse0 (select (select |old(#memory_int)| |~#d1~0.base|) .cse1)) (.cse2 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (or (and (< 0 (+ main_~pd1~0.offset 1)) (<= main_~pd1~0.offset 0) (= (select (select |#memory_int| main_~pd2~0.base) (+ 0 8)) main_~i~0) (= 0 main_~i~0) (= main_~pd2~0.offset 0) (= |~#d1~0.base| main_~pd1~0.base) (= .cse0 (select (select |#memory_int| |~#d1~0.base|) .cse1)) (or (<= (+ main_~i~0 1) .cse2) (= 0 .cse2))) (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse0 0)) (not (= 0 |~#d1~0.offset|)) (and (exists ((main_~pa~0.offset Int) (v_main_~i~0_22 Int)) (let ((.cse6 (select |#memory_int| main_~pd2~0.base)) (.cse4 (* 4 v_main_~i~0_22))) (let ((.cse3 (+ main_~pd2~0.offset .cse4 8)) (.cse5 (select .cse6 main_~pa~0.offset))) (and (<= .cse3 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse4 8)) (<= .cse5 main_~i~0) (= v_main_~i~0_22 (select .cse6 .cse3)) (<= main_~i~0 .cse5))))) (exists ((v_main_~i~0_22 Int)) (let ((.cse8 (* 4 v_main_~i~0_22))) (let ((.cse7 (+ main_~pd2~0.offset .cse8 8))) (and (= v_main_~i~0_22 (select (select |#memory_int| main_~pa~0.base) .cse7)) (<= .cse7 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse8 8)))))) (<= main_~i~0 .cse2) (<= main_~pd1~0.offset |~#d1~0.offset|) (<= 0 main_~pd2~0.offset) (= main_~pd2~0.base main_~pa~0.base)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|)))) [2018-11-23 00:02:39,365 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-23 00:02:39,365 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2018-11-23 00:02:39,366 INFO L444 ceAbstractionStarter]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse2 (+ |~#d1~0.offset| 8))) (let ((.cse1 (select (select |old(#memory_int)| |~#d1~0.base|) .cse2))) (let ((.cse0 (= .cse1 (select (select |#memory_int| |~#d1~0.base|) .cse2)))) (or (and (< 0 (+ main_~pd1~0.offset 1)) (<= main_~pd1~0.offset 0) (= |~#d1~0.base| main_~pd1~0.base) .cse0) (and (= |~#d2~0.base| main_~pd1~0.base) (= |~#d2~0.offset| main_~pd1~0.offset) .cse0) (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse1 0)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|))))) [2018-11-23 00:02:39,366 INFO L448 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2018-11-23 00:02:39,366 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 31 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|) (and (exists ((v_main_~i~0_22 Int) (v_main_~pd2~0.base_BEFORE_CALL_1 Int) (v_main_~pd2~0.offset_BEFORE_CALL_1 Int)) (and (<= 0 v_main_~pd2~0.offset_BEFORE_CALL_1) (= v_main_~i~0_22 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (+ (* 4 v_main_~i~0_22) v_main_~pd2~0.offset_BEFORE_CALL_1 8))) (<= v_main_~pd2~0.offset_BEFORE_CALL_1 0))) (= |#memory_int| |old(#memory_int)|))) [2018-11-23 00:02:39,366 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-23 00:02:39,366 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2018-11-23 00:02:39,366 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 26 29) the Hoare annotation is: true [2018-11-23 00:02:39,366 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 26 29) no Hoare annotation was computed. [2018-11-23 00:02:39,366 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 26 29) no Hoare annotation was computed. [2018-11-23 00:02:39,371 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,374 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,379 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,379 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,379 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,380 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,380 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,380 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:02:39 BoogieIcfgContainer [2018-11-23 00:02:39,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:02:39,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:02:39,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:02:39,382 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:02:39,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:41" (3/4) ... [2018-11-23 00:02:39,386 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 00:02:39,390 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-23 00:02:39,390 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 00:02:39,390 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-11-23 00:02:39,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 00:02:39,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-23 00:02:39,394 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2018-11-23 00:02:39,394 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 00:02:39,394 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 00:02:39,395 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 00:02:39,395 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 00:02:39,395 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 00:02:39,413 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_main_~i~0_22 : int :: (v_main_~i~0_22 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_22 + 8] && pd2 + 4 * v_main_~i~0_22 + 8 <= pa) && pa <= 4 * v_main_~i~0_22 + 8) && i <= unknown-#memory_int-unknown[pa][pa]) && pd1 <= d1) && 0 <= pd2) && pd2 == pa) || d2 < d1) || d1 == d2) || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || !(0 == d1)) || 0 < d2 [2018-11-23 00:02:39,413 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((d1 == d2 || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || 0 < d2) || d1 < d2) || 5 * d2 < d1 [2018-11-23 00:02:39,427 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5081bd9d-e372-4bd4-bdfb-054f75250251/bin-2019/uautomizer/witness.graphml [2018-11-23 00:02:39,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:02:39,428 INFO L168 Benchmark]: Toolchain (without parser) took 58282.21 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 491.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -115.6 MB). Peak memory consumption was 375.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:02:39,429 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:02:39,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 945.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:02:39,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -210.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:02:39,429 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:02:39,429 INFO L168 Benchmark]: RCFGBuilder took 193.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:02:39,430 INFO L168 Benchmark]: TraceAbstraction took 57757.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 638.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:02:39,430 INFO L168 Benchmark]: Witness Printer took 45.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:02:39,431 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 945.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -210.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57757.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 638.7 MB. Max. memory is 11.5 GB. * Witness Printer took 45.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] * 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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: 32]: Loop Invariant [2018-11-23 00:02:39,435 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,435 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((d1 == d2 || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || 0 < d2) || d1 < d2) || 5 * d2 < d1 - InvariantResult [Line: 40]: Loop Invariant [2018-11-23 00:02:39,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,437 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,437 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,437 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-23 00:02:39,439 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,439 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:02:39,439 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((\exists v_main_~i~0_22 : int :: (v_main_~i~0_22 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_22 + 8] && pd2 + 4 * v_main_~i~0_22 + 8 <= pa) && pa <= 4 * v_main_~i~0_22 + 8) && i <= unknown-#memory_int-unknown[pa][pa]) && pd1 <= d1) && 0 <= pd2) && pd2 == pa) || d2 < d1) || d1 == d2) || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || !(0 == d1)) || 0 < d2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. SAFE Result, 57.7s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 25.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 253 SDtfs, 599 SDslu, 2029 SDs, 0 SdLazy, 2576 SolverSat, 458 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 166 SyntacticMatches, 34 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4074 ImplicationChecksByTransitivity, 34.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 117 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 27 PreInvPairs, 51 NumberOfFragments, 545 HoareAnnotationTreeSize, 27 FomulaSimplifications, 80928 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 50174 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 524 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 509 ConstructedInterpolants, 33 QuantifiedInterpolants, 207687 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1405 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 93/228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...