./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/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 b974f281a213c0803f91ef44d205e442fb2a5f8f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:48:56,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:48:56,830 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:48:56,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:48:56,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:48:56,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:48:56,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:48:56,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:48:56,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:48:56,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:48:56,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:48:56,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:48:56,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:48:56,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:48:56,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:48:56,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:48:56,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:48:56,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:48:56,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:48:56,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:48:56,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:48:56,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:48:56,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:48:56,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:48:56,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:48:56,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:48:56,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:48:56,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:48:56,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:48:56,856 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:48:56,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:48:56,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:48:56,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:48:56,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:48:56,857 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:48:56,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:48:56,857 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:48:56,864 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:48:56,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:48:56,865 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:48:56,865 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:48:56,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:48:56,865 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:48:56,865 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:48:56,865 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:48:56,865 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:48:56,866 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:48:56,866 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:48:56,866 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:48:56,866 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:48:56,866 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:48:56,866 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:48:56,866 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:48:56,867 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:48:56,867 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:48:56,867 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:48:56,867 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:48:56,867 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:48:56,867 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:48:56,867 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:48:56,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:48:56,868 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:48:56,868 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:48:56,868 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:48:56,868 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:48:56,868 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:48:56,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:48:56,869 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_744d4815-20da-4a35-8f59-8e54271f1c82/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 -> b974f281a213c0803f91ef44d205e442fb2a5f8f [2018-11-28 12:48:56,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:48:56,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:48:56,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:48:56,903 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:48:56,903 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:48:56,904 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-11-28 12:48:56,940 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/data/5b14ef395/bcf950a617134f258c6ce60e73473933/FLAGd4f3b3ea6 [2018-11-28 12:48:57,337 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:48:57,338 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-11-28 12:48:57,341 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/data/5b14ef395/bcf950a617134f258c6ce60e73473933/FLAGd4f3b3ea6 [2018-11-28 12:48:57,349 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/data/5b14ef395/bcf950a617134f258c6ce60e73473933 [2018-11-28 12:48:57,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:48:57,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:48:57,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:48:57,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:48:57,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:48:57,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8b8459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57, skipping insertion in model container [2018-11-28 12:48:57,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:48:57,377 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:48:57,474 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:48:57,483 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:48:57,494 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:48:57,507 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:48:57,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57 WrapperNode [2018-11-28 12:48:57,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:48:57,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:48:57,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:48:57,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:48:57,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:48:57,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:48:57,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:48:57,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:48:57,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... [2018-11-28 12:48:57,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:48:57,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:48:57,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:48:57,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:48:57,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/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-28 12:48:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-28 12:48:57,630 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-28 12:48:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:48:57,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:48:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 12:48:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-28 12:48:57,630 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-28 12:48:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:48:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:48:57,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:48:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:48:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-28 12:48:57,631 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-28 12:48:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:48:57,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:48:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:48:57,823 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:48:57,823 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:48:57,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:48:57 BoogieIcfgContainer [2018-11-28 12:48:57,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:48:57,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:48:57,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:48:57,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:48:57,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:48:57" (1/3) ... [2018-11-28 12:48:57,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437131fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:48:57, skipping insertion in model container [2018-11-28 12:48:57,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:57" (2/3) ... [2018-11-28 12:48:57,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437131fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:48:57, skipping insertion in model container [2018-11-28 12:48:57,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:48:57" (3/3) ... [2018-11-28 12:48:57,830 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_false-unreach-call.c [2018-11-28 12:48:57,838 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:48:57,845 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:48:57,860 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:48:57,887 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:48:57,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:48:57,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:48:57,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:48:57,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:48:57,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:48:57,888 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:48:57,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:48:57,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:48:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-28 12:48:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:48:57,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:48:57,910 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-28 12:48:57,912 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:48:57,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1787337799, now seen corresponding path program 1 times [2018-11-28 12:48:57,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:57,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:58,073 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-28 12:48:58,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:48:58,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:48:58,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 12:48:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:48:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:48:58,086 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-28 12:48:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:48:58,099 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 12:48:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:48:58,100 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-28 12:48:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:48:58,105 INFO L225 Difference]: With dead ends: 46 [2018-11-28 12:48:58,105 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 12:48:58,107 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-28 12:48:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 12:48:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 12:48:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 12:48:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-28 12:48:58,134 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2018-11-28 12:48:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:48:58,136 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-28 12:48:58,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 12:48:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-28 12:48:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:48:58,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:48:58,138 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-28 12:48:58,138 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:48:58,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1425990092, now seen corresponding path program 1 times [2018-11-28 12:48:58,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:58,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:58,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:58,851 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-28 12:48:58,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:48:58,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:48:58,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:48:58,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:48:58,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:48:58,853 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-28 12:48:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:48:59,235 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-28 12:48:59,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:48:59,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-28 12:48:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:48:59,237 INFO L225 Difference]: With dead ends: 54 [2018-11-28 12:48:59,238 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 12:48:59,238 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-28 12:48:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 12:48:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-11-28 12:48:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 12:48:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-28 12:48:59,245 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2018-11-28 12:48:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:48:59,245 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-28 12:48:59,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:48:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-28 12:48:59,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:48:59,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:48:59,246 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-28 12:48:59,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:48:59,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:59,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1848691918, now seen corresponding path program 1 times [2018-11-28 12:48:59,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:59,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:59,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:59,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:59,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:59,313 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-28 12:48:59,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:48:59,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/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-28 12:48:59,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:59,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:59,393 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-28 12:48:59,410 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-28 12:48:59,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:48:59,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:48:59,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:48:59,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-28 12:48:59,445 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-28 12:48:59,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:48:59,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-28 12:48:59,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:48:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:48:59,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:48:59,461 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-11-28 12:48:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:48:59,625 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-28 12:48:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:48:59,625 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-28 12:48:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:48:59,626 INFO L225 Difference]: With dead ends: 56 [2018-11-28 12:48:59,626 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 12:48:59,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:48:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 12:48:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-28 12:48:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 12:48:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 12:48:59,635 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-11-28 12:48:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:48:59,635 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 12:48:59,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:48:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-28 12:48:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:48:59,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:48:59,636 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-28 12:48:59,636 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:48:59,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:59,637 INFO L82 PathProgramCache]: Analyzing trace with hash 568828240, now seen corresponding path program 1 times [2018-11-28 12:48:59,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:59,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:59,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:59,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:59,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:00,080 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 31 [2018-11-28 12:49:00,130 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-28 12:49:00,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:49:00,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:49:00,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:49:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:49:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:49:00,132 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2018-11-28 12:49:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:49:00,492 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-28 12:49:00,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:49:00,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-28 12:49:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:49:00,493 INFO L225 Difference]: With dead ends: 54 [2018-11-28 12:49:00,493 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 12:49:00,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:49:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 12:49:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-28 12:49:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 12:49:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-28 12:49:00,501 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2018-11-28 12:49:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:49:00,501 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-28 12:49:00,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:49:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-28 12:49:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:49:00,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:49:00,502 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-28 12:49:00,502 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:49:00,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash -957154489, now seen corresponding path program 1 times [2018-11-28 12:49:00,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:00,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:00,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:00,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:00,987 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-28 12:49:00,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:49:00,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/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-28 12:49:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:01,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:01,173 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-28 12:49:01,176 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-28 12:49:01,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:01,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:01,195 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-28 12:49:01,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-28 12:49:01,244 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-28 12:49:01,247 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:49:01,247 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-28 12:49:01,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:01,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:01,255 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-28 12:49:01,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-28 12:49:01,270 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-28 12:49:01,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:49:01,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-28 12:49:01,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 12:49:01,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 12:49:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-11-28 12:49:01,286 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 23 states. [2018-11-28 12:49:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:49:01,874 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-28 12:49:01,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 12:49:01,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-28 12:49:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:49:01,875 INFO L225 Difference]: With dead ends: 60 [2018-11-28 12:49:01,876 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 12:49:01,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 12:49:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 12:49:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2018-11-28 12:49:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 12:49:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 12:49:01,883 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-11-28 12:49:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:49:01,883 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 12:49:01,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 12:49:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 12:49:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:49:01,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:49:01,884 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-28 12:49:01,885 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:49:01,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -55973429, now seen corresponding path program 1 times [2018-11-28 12:49:01,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:01,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:02,301 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 26 [2018-11-28 12:49:02,399 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-28 12:49:02,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:49:02,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/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-28 12:49:02,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:02,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:02,535 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-28 12:49:02,538 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-28 12:49:02,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:02,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:02,547 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-28 12:49:02,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-11-28 12:49:02,591 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-28 12:49:02,593 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:49:02,594 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-28 12:49:02,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:02,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:02,603 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-28 12:49:02,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:5 [2018-11-28 12:49:02,622 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-28 12:49:02,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:49:02,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-28 12:49:02,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 12:49:02,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 12:49:02,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-11-28 12:49:02,638 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 23 states. [2018-11-28 12:49:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:49:03,243 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-28 12:49:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 12:49:03,243 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-28 12:49:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:49:03,244 INFO L225 Difference]: With dead ends: 62 [2018-11-28 12:49:03,244 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 12:49:03,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 12:49:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 12:49:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-28 12:49:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 12:49:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 12:49:03,253 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2018-11-28 12:49:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:49:03,253 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 12:49:03,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 12:49:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 12:49:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:49:03,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:49:03,254 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-28 12:49:03,255 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:49:03,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1263240701, now seen corresponding path program 2 times [2018-11-28 12:49:03,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:03,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:03,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:03,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:03,608 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 34 [2018-11-28 12:49:03,958 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-28 12:49:03,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:49:03,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/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-28 12:49:03,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:49:03,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:49:03,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:49:03,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:04,063 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-28 12:49:04,065 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-28 12:49:04,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:04,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:04,070 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-28 12:49:04,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-28 12:49:04,188 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-28 12:49:04,190 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-28 12:49:04,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:04,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:04,195 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-28 12:49:04,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:9 [2018-11-28 12:49:04,211 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-28 12:49:04,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:49:04,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2018-11-28 12:49:04,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 12:49:04,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 12:49:04,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-11-28 12:49:04,237 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 26 states. [2018-11-28 12:49:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:49:05,048 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-28 12:49:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 12:49:05,048 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-11-28 12:49:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:49:05,049 INFO L225 Difference]: With dead ends: 72 [2018-11-28 12:49:05,049 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 12:49:05,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=410, Invalid=1752, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 12:49:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 12:49:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2018-11-28 12:49:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 12:49:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-28 12:49:05,061 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 37 [2018-11-28 12:49:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:49:05,061 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-28 12:49:05,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 12:49:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-28 12:49:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:49:05,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:49:05,062 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-28 12:49:05,062 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:49:05,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -685796735, now seen corresponding path program 2 times [2018-11-28 12:49:05,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:05,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:05,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:49:05,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:05,732 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-28 12:49:05,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:49:05,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/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-28 12:49:05,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:49:05,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:49:05,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:49:05,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:05,831 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-28 12:49:05,840 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-28 12:49:05,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:05,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:05,846 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-28 12:49:05,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-11-28 12:49:05,923 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 41 treesize of output 33 [2018-11-28 12:49:05,925 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 33 treesize of output 25 [2018-11-28 12:49:05,926 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-28 12:49:05,939 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-28 12:49:05,943 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-28 12:49:05,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:5 [2018-11-28 12:49:05,959 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-28 12:49:05,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:49:05,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2018-11-28 12:49:05,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 12:49:05,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 12:49:05,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-11-28 12:49:05,975 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 26 states. [2018-11-28 12:49:06,592 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 54 [2018-11-28 12:49:06,711 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 87 [2018-11-28 12:49:06,859 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 56 [2018-11-28 12:49:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:49:07,763 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-28 12:49:07,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 12:49:07,764 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-11-28 12:49:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:49:07,764 INFO L225 Difference]: With dead ends: 101 [2018-11-28 12:49:07,764 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 12:49:07,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=740, Invalid=3166, Unknown=0, NotChecked=0, Total=3906 [2018-11-28 12:49:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 12:49:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 47. [2018-11-28 12:49:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 12:49:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-28 12:49:07,775 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2018-11-28 12:49:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:49:07,775 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-28 12:49:07,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 12:49:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-28 12:49:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 12:49:07,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:49:07,776 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-28 12:49:07,776 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:49:07,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2133408361, now seen corresponding path program 3 times [2018-11-28 12:49:07,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:07,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:07,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:07,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:49:07,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:08,497 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 26 [2018-11-28 12:49:09,374 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-28 12:49:09,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:49:09,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/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-28 12:49:09,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:49:09,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-28 12:49:09,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:49:09,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:09,493 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 15 treesize of output 12 [2018-11-28 12:49:09,495 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 12 treesize of output 11 [2018-11-28 12:49:09,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:09,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:09,501 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-28 12:49:09,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-11-28 12:49:09,714 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 36 treesize of output 30 [2018-11-28 12:49:09,715 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 30 treesize of output 9 [2018-11-28 12:49:09,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:09,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:49:09,720 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-28 12:49:09,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-28 12:49:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:49:09,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:49:09,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2018-11-28 12:49:09,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-28 12:49:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 12:49:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 12:49:09,753 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 34 states. [2018-11-28 12:49:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:49:11,760 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-11-28 12:49:11,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-28 12:49:11,760 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2018-11-28 12:49:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:49:11,761 INFO L225 Difference]: With dead ends: 96 [2018-11-28 12:49:11,761 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 12:49:11,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1584, Invalid=6426, Unknown=0, NotChecked=0, Total=8010 [2018-11-28 12:49:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 12:49:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 55. [2018-11-28 12:49:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 12:49:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-28 12:49:11,774 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 45 [2018-11-28 12:49:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:49:11,774 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-28 12:49:11,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-28 12:49:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-28 12:49:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 12:49:11,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:49:11,775 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 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-28 12:49:11,775 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:49:11,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash 821150421, now seen corresponding path program 4 times [2018-11-28 12:49:11,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:11,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:11,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:49:11,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:11,821 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 12:49:11,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:49:11 BoogieIcfgContainer [2018-11-28 12:49:11,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:49:11,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:49:11,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:49:11,864 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:49:11,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:48:57" (3/4) ... [2018-11-28 12:49:11,868 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 12:49:11,918 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_744d4815-20da-4a35-8f59-8e54271f1c82/bin-2019/uautomizer/witness.graphml [2018-11-28 12:49:11,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:49:11,919 INFO L168 Benchmark]: Toolchain (without parser) took 14567.30 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 439.4 MB). Free memory was 956.7 MB in the beginning and 1.0 GB in the end (delta: -66.6 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:11,919 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:49:11,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.94 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:11,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:11,920 INFO L168 Benchmark]: Boogie Preprocessor took 26.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:49:11,920 INFO L168 Benchmark]: RCFGBuilder took 236.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:11,920 INFO L168 Benchmark]: TraceAbstraction took 14038.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 287.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.0 MB). Peak memory consumption was 390.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:11,921 INFO L168 Benchmark]: Witness Printer took 54.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:49:11,924 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 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.94 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14038.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 287.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.0 MB). Peak memory consumption was 390.4 MB. Max. memory is 11.5 GB. * Witness Printer took 54.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] struct dummy d1, d2; VAL [\old(d1)=74, \old(d1)=80, \old(d2)=78, \old(d2)=76, d1={75:0}, d2={79:0}] [L33] CALL init() VAL [d1={75:0}, d2={79:0}] [L14] d1.a = __VERIFIER_nondet_int() [L15] d1.b = __VERIFIER_nondet_int() [L17] d2.a = __VERIFIER_nondet_int() [L18] d2.b = __VERIFIER_nondet_int() [L33] RET init() VAL [d1={75:0}, d2={79:0}] [L34] CALL, EXPR get_dummy() VAL [d1={75:0}, d2={79:0}] [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={75:0}, d1={75:0}, d2={79:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] RET, EXPR get_dummy() VAL [d1={75:0}, d2={79:0}, get_dummy()={75:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L34] CALL, EXPR get_dummy() VAL [d1={75:0}, d2={79:0}] [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={75:0}, d1={75:0}, d2={79:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] RET, EXPR get_dummy() VAL [d1={75:0}, d2={79:0}, get_dummy()={75:0}, pd1={75:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L35] int i = __VERIFIER_nondet_int(); [L36] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L37] pd2->array[i] = i [L38] int *pa = &pd1->array[i]; [L39] EXPR pd2->array[i] [L39] i = pd2->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-10, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-9, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-9, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-8, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-8, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-7, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-7, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-6, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-6, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-5, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-5, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-4, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-4, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-3, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-3, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-2, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-2, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=0, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=0, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND FALSE !(i <= *pa) [L43] CALL, EXPR check(pd2, i) VAL [\old(i)=1, d1={75:0}, d2={79:0}, s1={75:0}] [L28] EXPR s1->array[i] [L28] return s1->array[i] == i; [L43] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={75:0}, d2={79:0}, i=1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L43] COND TRUE !check(pd2, i) [L50] __VERIFIER_error() VAL [d1={75:0}, d2={79:0}, i=1, pa={75:8}, pd1={75:0}, pd2={75:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. UNSAFE Result, 13.9s OverallTime, 10 OverallIterations, 12 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 271 SDtfs, 525 SDslu, 2475 SDs, 0 SdLazy, 2344 SolverSat, 278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 170 SyntacticMatches, 33 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3987 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=9, 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, 147 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 509 ConstructedInterpolants, 28 QuantifiedInterpolants, 176631 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1430 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 47/228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...