./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 308e43cca528a064aecd41d099b341627e43bb71 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:07:02,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:07:02,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:07:02,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:07:02,983 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:07:02,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:07:02,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:07:02,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:07:02,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:07:02,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:07:02,988 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:07:02,988 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:07:02,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:07:02,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:07:02,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:07:02,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:07:02,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:07:02,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:07:02,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:07:02,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:07:02,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:07:02,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:07:02,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:07:02,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:07:02,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:07:02,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:07:03,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:07:03,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:07:03,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:07:03,002 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:07:03,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:07:03,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:07:03,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:07:03,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:07:03,003 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:07:03,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:07:03,003 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 14:07:03,011 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:07:03,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:07:03,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:07:03,012 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 14:07:03,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:07:03,012 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:07:03,013 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:07:03,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:07:03,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:07:03,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:07:03,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:07:03,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:07:03,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:07:03,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:07:03,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:07:03,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:07:03,014 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:07:03,014 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:07:03,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:07:03,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:07:03,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:07:03,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:07:03,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:07:03,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:07:03,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:07:03,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:07:03,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:07:03,015 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:07:03,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:07:03,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:07:03,016 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_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-11-18 14:07:03,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:07:03,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:07:03,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:07:03,048 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:07:03,049 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:07:03,049 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-18 14:07:03,083 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/data/b15e2b67d/4956139a469447ec8afe3004ddcedb3a/FLAG540ed01cb [2018-11-18 14:07:03,381 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:07:03,381 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-18 14:07:03,384 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/data/b15e2b67d/4956139a469447ec8afe3004ddcedb3a/FLAG540ed01cb [2018-11-18 14:07:03,394 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/data/b15e2b67d/4956139a469447ec8afe3004ddcedb3a [2018-11-18 14:07:03,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:07:03,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 14:07:03,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:07:03,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:07:03,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:07:03,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f418ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03, skipping insertion in model container [2018-11-18 14:07:03,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:07:03,420 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:07:03,530 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:07:03,537 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:07:03,550 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:07:03,560 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:07:03,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03 WrapperNode [2018-11-18 14:07:03,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:07:03,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:07:03,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:07:03,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:07:03,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (1/1) ... [2018-11-18 14:07:03,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:07:03,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:07:03,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:07:03,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:07:03,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/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-18 14:07:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:07:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:07:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-18 14:07:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-18 14:07:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-18 14:07:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:07:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 14:07:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 14:07:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-18 14:07:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-18 14:07:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 14:07:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-18 14:07:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-18 14:07:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 14:07:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:07:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:07:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 14:07:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 14:07:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:07:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 14:07:03,843 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:07:03,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:07:03 BoogieIcfgContainer [2018-11-18 14:07:03,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:07:03,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:07:03,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:07:03,846 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:07:03,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:07:03" (1/3) ... [2018-11-18 14:07:03,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c453596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:07:03, skipping insertion in model container [2018-11-18 14:07:03,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:07:03" (2/3) ... [2018-11-18 14:07:03,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c453596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:07:03, skipping insertion in model container [2018-11-18 14:07:03,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:07:03" (3/3) ... [2018-11-18 14:07:03,849 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-11-18 14:07:03,857 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:07:03,863 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:07:03,877 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:07:03,903 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:07:03,903 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:07:03,903 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:07:03,903 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:07:03,904 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:07:03,904 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:07:03,904 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:07:03,904 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:07:03,904 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:07:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-18 14:07:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 14:07:03,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:07:03,925 INFO L375 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-18 14:07:03,927 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:07:03,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:07:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1786553997, now seen corresponding path program 1 times [2018-11-18 14:07:03,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:07:03,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:07:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:03,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:04,066 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-18 14:07:04,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:07:04,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:07:04,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 14:07:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 14:07:04,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 14:07:04,080 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-18 14:07:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:07:04,092 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-18 14:07:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 14:07:04,093 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-18 14:07:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:07:04,100 INFO L225 Difference]: With dead ends: 47 [2018-11-18 14:07:04,100 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 14:07:04,103 INFO L604 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-18 14:07:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 14:07:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 14:07:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 14:07:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 14:07:04,129 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 30 [2018-11-18 14:07:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:07:04,130 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 14:07:04,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 14:07:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 14:07:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 14:07:04,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:07:04,132 INFO L375 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, 1] [2018-11-18 14:07:04,132 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:07:04,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:07:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash 258535257, now seen corresponding path program 1 times [2018-11-18 14:07:04,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:07:04,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:07:04,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:04,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:04,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:04,377 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-18 14:07:04,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:07:04,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 14:07:04,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:07:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:07:04,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 14:07:04,379 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 11 states. [2018-11-18 14:07:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:07:04,621 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-18 14:07:04,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:07:04,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 14:07:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:07:04,624 INFO L225 Difference]: With dead ends: 57 [2018-11-18 14:07:04,624 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 14:07:04,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:07:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 14:07:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-11-18 14:07:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 14:07:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 14:07:04,630 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 32 [2018-11-18 14:07:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:07:04,631 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 14:07:04,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:07:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 14:07:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 14:07:04,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:07:04,631 INFO L375 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, 1] [2018-11-18 14:07:04,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:07:04,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:07:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash 477389975, now seen corresponding path program 1 times [2018-11-18 14:07:04,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:07:04,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:07:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:04,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:04,720 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-18 14:07:04,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:07:04,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/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-18 14:07:04,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:04,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:07:04,804 INFO L477 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-18 14:07:04,812 INFO L477 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-18 14:07:04,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:07:04,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:04,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:04,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-18 14:07:04,845 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-18 14:07:04,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:07:04,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-18 14:07:04,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 14:07:04,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 14:07:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:07:04,861 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 13 states. [2018-11-18 14:07:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:07:05,037 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-18 14:07:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:07:05,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-18 14:07:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:07:05,038 INFO L225 Difference]: With dead ends: 60 [2018-11-18 14:07:05,038 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 14:07:05,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:07:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 14:07:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-11-18 14:07:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 14:07:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-18 14:07:05,044 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 32 [2018-11-18 14:07:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:07:05,044 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-18 14:07:05,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 14:07:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-18 14:07:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 14:07:05,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:07:05,045 INFO L375 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, 1] [2018-11-18 14:07:05,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:07:05,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:07:05,046 INFO L82 PathProgramCache]: Analyzing trace with hash -543678379, now seen corresponding path program 1 times [2018-11-18 14:07:05,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:07:05,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:07:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:05,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:05,227 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-18 14:07:05,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:07:05,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 14:07:05,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:07:05,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:07:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 14:07:05,228 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-18 14:07:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:07:05,376 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-18 14:07:05,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:07:05,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 14:07:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:07:05,377 INFO L225 Difference]: With dead ends: 58 [2018-11-18 14:07:05,377 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 14:07:05,377 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:07:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 14:07:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2018-11-18 14:07:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 14:07:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 14:07:05,382 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 32 [2018-11-18 14:07:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:07:05,383 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 14:07:05,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:07:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 14:07:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 14:07:05,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:07:05,384 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:07:05,384 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:07:05,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:07:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1823664487, now seen corresponding path program 1 times [2018-11-18 14:07:05,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:07:05,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:07:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:05,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:07:05,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:07:05,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/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-18 14:07:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:05,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:07:05,685 INFO L477 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-18 14:07:05,687 INFO L477 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-18 14:07:05,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:07:05,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:05,694 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-18 14:07:05,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-18 14:07:05,741 INFO L477 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-18 14:07:05,757 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 14:07:05,757 INFO L477 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-18 14:07:05,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:07:05,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:05,766 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-18 14:07:05,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-18 14:07:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:07:05,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:07:05,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-11-18 14:07:05,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 14:07:05,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 14:07:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-11-18 14:07:05,798 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 22 states. [2018-11-18 14:07:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:07:06,154 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-18 14:07:06,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 14:07:06,161 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2018-11-18 14:07:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:07:06,162 INFO L225 Difference]: With dead ends: 66 [2018-11-18 14:07:06,162 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 14:07:06,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-11-18 14:07:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 14:07:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-11-18 14:07:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 14:07:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-18 14:07:06,171 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2018-11-18 14:07:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:07:06,172 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-18 14:07:06,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 14:07:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-18 14:07:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 14:07:06,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:07:06,173 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:07:06,173 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:07:06,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:07:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash 922907677, now seen corresponding path program 1 times [2018-11-18 14:07:06,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:07:06,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:07:06,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:06,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:06,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:07:06,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:07:06,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/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-18 14:07:06,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:06,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:07:06,470 INFO L477 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-18 14:07:06,478 INFO L477 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-18 14:07:06,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:07:06,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:06,490 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-18 14:07:06,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-18 14:07:06,550 INFO L477 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-18 14:07:06,552 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 14:07:06,553 INFO L477 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-18 14:07:06,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:07:06,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:06,560 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-18 14:07:06,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-18 14:07:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:07:06,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:07:06,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-11-18 14:07:06,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 14:07:06,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 14:07:06,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-11-18 14:07:06,594 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 22 states. [2018-11-18 14:07:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:07:06,904 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-18 14:07:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 14:07:06,904 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2018-11-18 14:07:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:07:06,905 INFO L225 Difference]: With dead ends: 70 [2018-11-18 14:07:06,905 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 14:07:06,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-11-18 14:07:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 14:07:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-18 14:07:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 14:07:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-18 14:07:06,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2018-11-18 14:07:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:07:06,913 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-18 14:07:06,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 14:07:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-18 14:07:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 14:07:06,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:07:06,914 INFO L375 BasicCegarLoop]: trace histogram [4, 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-18 14:07:06,914 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:07:06,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:07:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1010458265, now seen corresponding path program 2 times [2018-11-18 14:07:06,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:07:06,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:07:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:06,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:07:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:07:07,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:07:07,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/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-18 14:07:07,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:07:07,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:07:07,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:07:07,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:07:07,164 INFO L477 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-18 14:07:07,166 INFO L477 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-18 14:07:07,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:07:07,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:07,172 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-18 14:07:07,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-11-18 14:07:07,225 INFO L477 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 17 treesize of output 13 [2018-11-18 14:07:07,227 INFO L477 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 13 treesize of output 9 [2018-11-18 14:07:07,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:07:07,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:07,229 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-18 14:07:07,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-18 14:07:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:07:07,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:07:07,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-11-18 14:07:07,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 14:07:07,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 14:07:07,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-11-18 14:07:07,255 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 22 states. [2018-11-18 14:07:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:07:07,789 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-11-18 14:07:07,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 14:07:07,790 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-11-18 14:07:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:07:07,790 INFO L225 Difference]: With dead ends: 96 [2018-11-18 14:07:07,791 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 14:07:07,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=594, Invalid=2268, Unknown=0, NotChecked=0, Total=2862 [2018-11-18 14:07:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 14:07:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 55. [2018-11-18 14:07:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 14:07:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-18 14:07:07,805 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 41 [2018-11-18 14:07:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:07:07,806 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-18 14:07:07,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 14:07:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-18 14:07:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 14:07:07,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:07:07,807 INFO L375 BasicCegarLoop]: trace histogram [8, 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-18 14:07:07,807 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:07:07,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:07:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash 122875545, now seen corresponding path program 3 times [2018-11-18 14:07:07,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:07:07,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:07:07,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:07,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:07:07,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:07:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:07:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:07:08,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:07:08,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/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-18 14:07:08,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:07:08,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 14:07:08,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:07:08,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:07:08,143 INFO L477 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-18 14:07:08,145 INFO L477 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-18 14:07:08,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:07:08,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:07:08,152 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-18 14:07:08,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-18 14:07:10,312 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_18 Int) (v_main_~pd2~0.base_BEFORE_CALL_1 Int) (v_main_~pd2~0.offset_BEFORE_CALL_1 Int)) (= v_main_~i~0_18 (select (select |c_#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (+ (* 4 v_main_~i~0_18) v_main_~pd2~0.offset_BEFORE_CALL_1 8)))) is different from true [2018-11-18 14:07:16,363 WARN L180 SmtUtils]: Spent 6.02 s on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-11-18 14:07:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-18 14:07:16,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:07:16,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2018-11-18 14:07:16,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 14:07:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 14:07:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=662, Unknown=1, NotChecked=52, Total=812 [2018-11-18 14:07:16,412 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 29 states. [2018-11-18 14:07:54,957 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 14:07:56,995 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 14:07:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:07:57,235 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-18 14:07:57,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 14:07:57,238 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2018-11-18 14:07:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:07:57,238 INFO L225 Difference]: With dead ends: 95 [2018-11-18 14:07:57,238 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:07:57,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=592, Invalid=2710, Unknown=8, NotChecked=112, Total=3422 [2018-11-18 14:07:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:07:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:07:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:07:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:07:57,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-11-18 14:07:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:07:57,240 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:07:57,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 14:07:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:07:57,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:07:57,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:07:57,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:07:57,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:07:57,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:07:57,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:07:57,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:07:57,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:07:59,421 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 28 DAG size of output: 1 [2018-11-18 14:07:59,620 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 33 [2018-11-18 14:07:59,624 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 12 19) no Hoare annotation was computed. [2018-11-18 14:07:59,624 INFO L428 ceAbstractionStarter]: At program point initENTRY(lines 12 19) the Hoare annotation is: true [2018-11-18 14:07:59,624 INFO L425 ceAbstractionStarter]: For program point initFINAL(lines 12 19) no Hoare annotation was computed. [2018-11-18 14:07:59,624 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:07:59,624 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:07:59,624 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:07:59,624 INFO L425 ceAbstractionStarter]: For program point get_dummyFINAL(lines 21 24) no Hoare annotation was computed. [2018-11-18 14:07:59,624 INFO L428 ceAbstractionStarter]: At program point get_dummyENTRY(lines 21 24) the Hoare annotation is: true [2018-11-18 14:07:59,624 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-18 14:07:59,624 INFO L425 ceAbstractionStarter]: For program point get_dummyEXIT(lines 21 24) no Hoare annotation was computed. [2018-11-18 14:07:59,624 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:07:59,624 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= 0 |~#d1~0.offset|)) [2018-11-18 14:07:59,625 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L428 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: true [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 31 52) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 31 52) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L421 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|))) [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L421 ceAbstractionStarter]: At program point L40-4(lines 40 42) the Hoare annotation is: (or (not (= |~#d2~0.offset| 0)) (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_18 Int)) (let ((.cse0 (* 4 v_main_~i~0_18))) (and (= v_main_~i~0_18 (select (select |#memory_int| main_~pa~0.base) (+ main_~pd2~0.offset .cse0 8))) (= main_~pa~0.offset (+ .cse0 main_~pd2~0.offset 8))))) (= main_~pd2~0.base main_~pa~0.base)) (= |~#d1~0.base| |~#d2~0.base|) (not (= 0 |~#d1~0.offset|))) [2018-11-18 14:07:59,625 INFO L421 ceAbstractionStarter]: At program point L40-5(lines 40 42) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (and (exists ((v_main_~i~0_18 Int)) (let ((.cse1 (select |#memory_int| main_~pd2~0.base)) (.cse2 (* 4 v_main_~i~0_18))) (let ((.cse0 (select .cse1 (+ .cse2 main_~pd2~0.offset 8)))) (and (<= main_~i~0 .cse0) (<= .cse0 main_~i~0) (= v_main_~i~0_18 (select .cse1 (+ main_~pd2~0.offset .cse2 8))))))) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_18 Int)) (let ((.cse3 (* 4 v_main_~i~0_18))) (and (= v_main_~i~0_18 (select (select |#memory_int| main_~pa~0.base) (+ main_~pd2~0.offset .cse3 8))) (= main_~pa~0.offset (+ .cse3 main_~pd2~0.offset 8))))) (= main_~pd2~0.base main_~pa~0.base))) [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L421 ceAbstractionStarter]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (= 0 main_~pd1~0.offset))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (and .cse0 (= |~#d1~0.base| main_~pd1~0.base)) (and (= |~#d2~0.base| main_~pd1~0.base) .cse0))) [2018-11-18 14:07:59,625 INFO L425 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2018-11-18 14:07:59,625 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 31 52) the Hoare annotation is: true [2018-11-18 14:07:59,626 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-18 14:07:59,626 INFO L425 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2018-11-18 14:07:59,626 INFO L428 ceAbstractionStarter]: At program point checkENTRY(lines 26 29) the Hoare annotation is: true [2018-11-18 14:07:59,626 INFO L425 ceAbstractionStarter]: For program point checkFINAL(lines 26 29) no Hoare annotation was computed. [2018-11-18 14:07:59,626 INFO L425 ceAbstractionStarter]: For program point checkEXIT(lines 26 29) no Hoare annotation was computed. [2018-11-18 14:07:59,638 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,638 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,639 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,639 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:07:59,639 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:07:59,640 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,640 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,640 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,640 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:07:59,640 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:07:59,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:07:59 BoogieIcfgContainer [2018-11-18 14:07:59,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:07:59,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:07:59,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:07:59,642 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:07:59,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:07:03" (3/4) ... [2018-11-18 14:07:59,648 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:07:59,653 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-18 14:07:59,653 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:07:59,654 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-11-18 14:07:59,654 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:07:59,654 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-18 14:07:59,657 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-18 14:07:59,657 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 14:07:59,657 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 14:07:59,658 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 14:07:59,658 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 14:07:59,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(d2 == 0) || ((i <= unknown-#memory_int-unknown[pa][pa] && (\exists v_main_~i~0_18 : int :: v_main_~i~0_18 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_18 + 8] && pa == 4 * v_main_~i~0_18 + pd2 + 8)) && pd2 == pa)) || d1 == d2) || !(0 == d1) [2018-11-18 14:07:59,696 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d2982910-db95-48c8-a6c6-13ad9dd4288c/bin-2019/uautomizer/witness.graphml [2018-11-18 14:07:59,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:07:59,697 INFO L168 Benchmark]: Toolchain (without parser) took 56300.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 959.1 MB in the beginning and 918.2 MB in the end (delta: 40.9 MB). Peak memory consumption was 218.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:07:59,698 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:07:59,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.74 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:07:59,698 INFO L168 Benchmark]: Boogie Preprocessor took 24.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:07:59,698 INFO L168 Benchmark]: RCFGBuilder took 256.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:07:59,699 INFO L168 Benchmark]: TraceAbstraction took 55798.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 924.5 MB in the end (delta: 174.1 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:07:59,699 INFO L168 Benchmark]: Witness Printer took 54.25 ms. Allocated memory is still 1.2 GB. Free memory was 924.5 MB in the beginning and 918.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:07:59,700 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.09 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.74 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 256.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55798.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 924.5 MB in the end (delta: 174.1 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. * Witness Printer took 54.25 ms. Allocated memory is still 1.2 GB. Free memory was 924.5 MB in the beginning and 918.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (d1 == d2 || !(d2 == 0)) || !(0 == d1) - InvariantResult [Line: 40]: Loop Invariant [2018-11-18 14:07:59,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:07:59,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:07:59,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,708 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_18,QUANTIFIED] [2018-11-18 14:07:59,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:07:59,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((!(d2 == 0) || ((i <= unknown-#memory_int-unknown[pa][pa] && (\exists v_main_~i~0_18 : int :: v_main_~i~0_18 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_18 + 8] && pa == 4 * v_main_~i~0_18 + pd2 + 8)) && pd2 == pa)) || d1 == d2) || !(0 == d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. SAFE Result, 55.7s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 42.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 245 SDtfs, 475 SDslu, 2022 SDs, 0 SdLazy, 1741 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 167 SyntacticMatches, 22 SemanticMatches, 212 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 51.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 96 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 23 PreInvPairs, 43 NumberOfFragments, 184 HoareAnnotationTreeSize, 23 FomulaSimplifications, 20103 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 3117 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 486 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 473 ConstructedInterpolants, 38 QuantifiedInterpolants, 132404 SizeOfPredicates, 43 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 116/268 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...