./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/test23_false-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_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b974f281a213c0803f91ef44d205e442fb2a5f8f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:13:50,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:13:50,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:13:50,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:13:50,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:13:50,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:13:50,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:13:50,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:13:50,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:13:50,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:13:50,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:13:50,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:13:50,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:13:50,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:13:50,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:13:50,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:13:50,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:13:50,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:13:50,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:13:50,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:13:50,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:13:50,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:13:50,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:13:50,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:13:50,046 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:13:50,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:13:50,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:13:50,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:13:50,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:13:50,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:13:50,051 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:13:50,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:13:50,052 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:13:50,052 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:13:50,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:13:50,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:13:50,054 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 15:13:50,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:13:50,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:13:50,076 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:13:50,076 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 15:13:50,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:13:50,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:13:50,077 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:13:50,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:13:50,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:13:50,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:13:50,077 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:13:50,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:13:50,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:13:50,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:13:50,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:13:50,078 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:13:50,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:13:50,078 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:13:50,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:13:50,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:13:50,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:13:50,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:13:50,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:13:50,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:13:50,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:13:50,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:13:50,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:13:50,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:13:50,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:13:50,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:13:50,080 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_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b974f281a213c0803f91ef44d205e442fb2a5f8f [2018-11-18 15:13:50,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:13:50,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:13:50,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:13:50,140 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:13:50,141 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:13:50,141 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-11-18 15:13:50,197 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/data/a29e94bb8/4ecc22770c334c43a2f59475203cf92b/FLAG9943cca10 [2018-11-18 15:13:50,580 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:13:50,580 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-11-18 15:13:50,585 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/data/a29e94bb8/4ecc22770c334c43a2f59475203cf92b/FLAG9943cca10 [2018-11-18 15:13:50,596 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/data/a29e94bb8/4ecc22770c334c43a2f59475203cf92b [2018-11-18 15:13:50,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:13:50,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 15:13:50,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:13:50,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:13:50,604 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:13:50,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c10af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50, skipping insertion in model container [2018-11-18 15:13:50,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:13:50,626 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:13:50,751 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:13:50,760 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:13:50,774 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:13:50,784 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:13:50,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50 WrapperNode [2018-11-18 15:13:50,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:13:50,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:13:50,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:13:50,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:13:50,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (1/1) ... [2018-11-18 15:13:50,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:13:50,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:13:50,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:13:50,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:13:50,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/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 15:13:50,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:13:50,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:13:50,919 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-18 15:13:50,919 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-18 15:13:50,919 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-18 15:13:50,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:13:50,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 15:13:50,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:13:50,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:13:50,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 15:13:50,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:13:50,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:13:51,206 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:13:51,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:13:51 BoogieIcfgContainer [2018-11-18 15:13:51,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:13:51,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:13:51,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:13:51,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:13:51,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:13:50" (1/3) ... [2018-11-18 15:13:51,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382436fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:13:51, skipping insertion in model container [2018-11-18 15:13:51,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:13:50" (2/3) ... [2018-11-18 15:13:51,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382436fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:13:51, skipping insertion in model container [2018-11-18 15:13:51,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:13:51" (3/3) ... [2018-11-18 15:13:51,214 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_false-unreach-call.c [2018-11-18 15:13:51,223 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:13:51,230 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:13:51,245 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:13:51,271 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:13:51,272 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:13:51,272 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:13:51,272 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:13:51,272 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:13:51,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:13:51,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:13:51,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:13:51,273 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:13:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-18 15:13:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 15:13:51,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:13:51,294 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 15:13:51,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:13:51,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:13:51,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1786553997, now seen corresponding path program 1 times [2018-11-18 15:13:51,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:13:51,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:13:51,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:51,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:51,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:51,467 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 15:13:51,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:13:51,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:13:51,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:13:51,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:13:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:13:51,483 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-18 15:13:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:13:51,497 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-18 15:13:51,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:13:51,498 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-18 15:13:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:13:51,504 INFO L225 Difference]: With dead ends: 47 [2018-11-18 15:13:51,504 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 15:13:51,507 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 15:13:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 15:13:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 15:13:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 15:13:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 15:13:51,540 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 30 [2018-11-18 15:13:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:13:51,542 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 15:13:51,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:13:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 15:13:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 15:13:51,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:13:51,544 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 15:13:51,544 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:13:51,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:13:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 258535257, now seen corresponding path program 1 times [2018-11-18 15:13:51,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:13:51,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:13:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:51,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:52,003 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 15:13:52,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:13:52,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:13:52,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:13:52,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:13:52,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:13:52,007 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 11 states. [2018-11-18 15:13:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:13:52,635 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-18 15:13:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:13:52,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 15:13:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:13:52,638 INFO L225 Difference]: With dead ends: 57 [2018-11-18 15:13:52,639 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 15:13:52,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-18 15:13:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 15:13:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-11-18 15:13:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 15:13:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 15:13:52,649 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 32 [2018-11-18 15:13:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:13:52,650 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 15:13:52,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:13:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 15:13:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 15:13:52,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:13:52,652 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 15:13:52,652 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:13:52,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:13:52,652 INFO L82 PathProgramCache]: Analyzing trace with hash 477389975, now seen corresponding path program 1 times [2018-11-18 15:13:52,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:13:52,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:13:52,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:52,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:52,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:52,814 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 15:13:52,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:13:52,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/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 15:13:52,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:52,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:13:52,895 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 15:13:52,909 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 15:13:52,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:52,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:52,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:52,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-18 15:13:52,999 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 15:13:53,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:13:53,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-18 15:13:53,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 15:13:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 15:13:53,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:13:53,025 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 13 states. [2018-11-18 15:13:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:13:53,537 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-18 15:13:53,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:13:53,538 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-18 15:13:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:13:53,539 INFO L225 Difference]: With dead ends: 60 [2018-11-18 15:13:53,539 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 15:13:53,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-18 15:13:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 15:13:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-11-18 15:13:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 15:13:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-18 15:13:53,546 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 32 [2018-11-18 15:13:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:13:53,546 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-18 15:13:53,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 15:13:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-18 15:13:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 15:13:53,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:13:53,548 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 15:13:53,548 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:13:53,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:13:53,548 INFO L82 PathProgramCache]: Analyzing trace with hash -543678379, now seen corresponding path program 1 times [2018-11-18 15:13:53,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:13:53,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:13:53,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:53,874 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 15:13:53,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:13:53,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:13:53,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:13:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:13:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:13:53,876 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-18 15:13:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:13:54,223 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-18 15:13:54,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:13:54,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 15:13:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:13:54,224 INFO L225 Difference]: With dead ends: 58 [2018-11-18 15:13:54,224 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 15:13:54,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-18 15:13:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 15:13:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2018-11-18 15:13:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 15:13:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 15:13:54,231 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 32 [2018-11-18 15:13:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:13:54,231 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 15:13:54,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:13:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 15:13:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 15:13:54,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:13:54,232 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 15:13:54,233 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:13:54,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:13:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1823664487, now seen corresponding path program 1 times [2018-11-18 15:13:54,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:13:54,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:13:54,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:54,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:54,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:54,542 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 15:13:54,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:13:54,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/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 15:13:54,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:54,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:13:54,772 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 15:13:54,774 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 15:13:54,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:54,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:54,783 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 15:13:54,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-18 15:13:54,861 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 15:13:54,864 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:13:54,865 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 15:13:54,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:54,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:54,910 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 15:13:54,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-18 15:13:54,926 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 15:13:54,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:13:54,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-11-18 15:13:54,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 15:13:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 15:13:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:13:54,944 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 22 states. [2018-11-18 15:13:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:13:55,744 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-18 15:13:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:13:55,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2018-11-18 15:13:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:13:55,746 INFO L225 Difference]: With dead ends: 66 [2018-11-18 15:13:55,746 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 15:13:55,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-11-18 15:13:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 15:13:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-11-18 15:13:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 15:13:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-18 15:13:55,754 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2018-11-18 15:13:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:13:55,754 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-18 15:13:55,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 15:13:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-18 15:13:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 15:13:55,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:13:55,757 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 15:13:55,757 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:13:55,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:13:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash 922907677, now seen corresponding path program 1 times [2018-11-18 15:13:55,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:13:55,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:13:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:56,007 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 15:13:56,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:13:56,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/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 15:13:56,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:56,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:13:56,429 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 15:13:56,431 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 15:13:56,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:56,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:56,444 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 15:13:56,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-18 15:13:56,513 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 15:13:56,515 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:13:56,516 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 15:13:56,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:56,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:56,531 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 15:13:56,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-18 15:13:56,551 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 15:13:56,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:13:56,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-11-18 15:13:56,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 15:13:56,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 15:13:56,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:13:56,574 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 22 states. [2018-11-18 15:13:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:13:57,245 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-18 15:13:57,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:13:57,245 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2018-11-18 15:13:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:13:57,246 INFO L225 Difference]: With dead ends: 70 [2018-11-18 15:13:57,247 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 15:13:57,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-11-18 15:13:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 15:13:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-18 15:13:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 15:13:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-18 15:13:57,255 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2018-11-18 15:13:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:13:57,255 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-18 15:13:57,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 15:13:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-18 15:13:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 15:13:57,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:13:57,259 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 15:13:57,259 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:13:57,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:13:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1010458265, now seen corresponding path program 2 times [2018-11-18 15:13:57,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:13:57,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:13:57,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:57,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:13:57,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:57,625 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 15:13:57,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:13:57,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/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 15:13:57,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:13:57,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:13:57,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:13:57,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:13:57,746 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 15:13:57,748 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 15:13:57,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:57,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:57,753 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 15:13:57,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-11-18 15:13:57,840 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 15:13:57,842 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 15:13:57,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:57,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:57,845 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 15:13:57,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-18 15:13:57,858 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 15:13:57,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:13:57,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-11-18 15:13:57,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 15:13:57,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 15:13:57,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:13:57,877 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 22 states. [2018-11-18 15:13:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:13:59,110 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-11-18 15:13:59,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 15:13:59,111 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-11-18 15:13:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:13:59,111 INFO L225 Difference]: With dead ends: 96 [2018-11-18 15:13:59,111 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 15:13:59,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=594, Invalid=2268, Unknown=0, NotChecked=0, Total=2862 [2018-11-18 15:13:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 15:13:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 55. [2018-11-18 15:13:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 15:13:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-18 15:13:59,119 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 41 [2018-11-18 15:13:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:13:59,119 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-18 15:13:59,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 15:13:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-18 15:13:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 15:13:59,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:13:59,120 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 15:13:59,120 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:13:59,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:13:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash 122875545, now seen corresponding path program 3 times [2018-11-18 15:13:59,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:13:59,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:13:59,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:59,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:13:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:13:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:13:59,765 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 15:13:59,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:13:59,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/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 15:13:59,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:13:59,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-18 15:13:59,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:13:59,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:13:59,818 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 15:13:59,819 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 15:13:59,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:59,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:59,825 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 15:13:59,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-11-18 15:13:59,988 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 15:13:59,991 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 15:13:59,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:13:59,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:13:59,993 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 15:13:59,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-18 15:14:00,017 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 15:14:00,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:14:00,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2018-11-18 15:14:00,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 15:14:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 15:14:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-11-18 15:14:00,034 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 28 states. [2018-11-18 15:14:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:01,174 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-11-18 15:14:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-18 15:14:01,174 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-11-18 15:14:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:01,175 INFO L225 Difference]: With dead ends: 111 [2018-11-18 15:14:01,175 INFO L226 Difference]: Without dead ends: 103 [2018-11-18 15:14:01,177 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1006, Invalid=3824, Unknown=0, NotChecked=0, Total=4830 [2018-11-18 15:14:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-18 15:14:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2018-11-18 15:14:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 15:14:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-18 15:14:01,191 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 53 [2018-11-18 15:14:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:01,191 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-18 15:14:01,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 15:14:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-18 15:14:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 15:14:01,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:01,192 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 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 15:14:01,192 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:01,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1141453739, now seen corresponding path program 2 times [2018-11-18 15:14:01,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:14:01,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:14:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:01,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:14:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:14:01,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:14:01,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:14:01,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:14:01,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:14:01,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:14:01,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:14:01,678 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 15:14:01,680 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 15:14:01,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:14:01,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:14:01,692 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 15:14:01,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-11-18 15:14:01,859 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 15:14:01,861 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 15:14:01,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:14:01,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:14:01,863 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 15:14:01,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-18 15:14:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 15:14:01,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:14:01,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 32 [2018-11-18 15:14:01,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 15:14:01,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 15:14:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2018-11-18 15:14:01,920 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 32 states. [2018-11-18 15:14:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:03,268 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-11-18 15:14:03,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-18 15:14:03,269 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-11-18 15:14:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:03,269 INFO L225 Difference]: With dead ends: 118 [2018-11-18 15:14:03,270 INFO L226 Difference]: Without dead ends: 110 [2018-11-18 15:14:03,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1152, Invalid=4548, Unknown=0, NotChecked=0, Total=5700 [2018-11-18 15:14:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-18 15:14:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 67. [2018-11-18 15:14:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 15:14:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-18 15:14:03,284 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 56 [2018-11-18 15:14:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:03,285 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-18 15:14:03,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 15:14:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-18 15:14:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:14:03,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:03,286 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:14:03,286 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:03,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1575780711, now seen corresponding path program 4 times [2018-11-18 15:14:03,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:14:03,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:14:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:03,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:14:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:14:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:14:03,354 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 15:14:03,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:14:03 BoogieIcfgContainer [2018-11-18 15:14:03,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:14:03,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:14:03,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:14:03,398 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:14:03,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:13:51" (3/4) ... [2018-11-18 15:14:03,402 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 15:14:03,470 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9d92ee25-6023-4067-a1f0-6f1620080d4a/bin-2019/uautomizer/witness.graphml [2018-11-18 15:14:03,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:14:03,471 INFO L168 Benchmark]: Toolchain (without parser) took 12871.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.3 MB). Free memory was 961.1 MB in the beginning and 1.3 GB in the end (delta: -314.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:14:03,472 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:14:03,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.82 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 947.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 15:14:03,474 INFO L168 Benchmark]: Boogie Preprocessor took 34.43 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:14:03,474 INFO L168 Benchmark]: RCFGBuilder took 386.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 947.7 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:14:03,475 INFO L168 Benchmark]: TraceAbstraction took 12190.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -129.8 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:14:03,475 INFO L168 Benchmark]: Witness Printer took 72.31 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-18 15:14:03,477 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.82 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 947.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 34.43 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 386.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 947.7 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12190.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -129.8 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * Witness Printer took 72.31 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] FCALL struct dummy d1, d2; VAL [\old(d1)=74, \old(d1)=79, \old(d2)=75, \old(d2)=77, d1={1:0}, d2={78:0}] [L33] CALL init() VAL [d1={1:0}, d2={78:0}] [L14] FCALL d1.a = __VERIFIER_nondet_int() [L15] FCALL d1.b = __VERIFIER_nondet_int() [L17] FCALL d2.a = __VERIFIER_nondet_int() [L18] RET, FCALL d2.b = __VERIFIER_nondet_int() [L33] init() VAL [d1={1:0}, d2={78:0}] [L34] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}] [L23] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={78:0}] [L23] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] EXPR get_dummy() VAL [d1={1:0}, d2={78:0}, get_dummy()={1:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L34] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}] [L23] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={78:0}] [L23] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] EXPR get_dummy() VAL [d1={1:0}, d2={78:0}, get_dummy()={1:0}, pd1={1:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L35] int i = __VERIFIER_nondet_int(); [L36] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L37] FCALL pd2->array[i] = i [L38] int *pa = &pd1->array[i]; [L39] EXPR, FCALL pd2->array[i] [L39] i = pd2->array[i] - 10 [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=0, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=0, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=5, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=5, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=6, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=6, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND FALSE !(i <= *pa) [L43] CALL, EXPR check(pd2, i) VAL [\old(i)=7, d1={1:0}, d2={78:0}, s1={1:0}] [L28] EXPR, FCALL s1->array[i] [L28] RET return s1->array[i] == i; [L43] EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L43] COND TRUE !check(pd2, i) [L50] __VERIFIER_error() VAL [d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. UNSAFE Result, 12.1s OverallTime, 10 OverallIterations, 12 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 288 SDtfs, 646 SDslu, 2473 SDs, 0 SdLazy, 1961 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 215 SyntacticMatches, 25 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3215 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 173 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 583 ConstructedInterpolants, 10 QuantifiedInterpolants, 140643 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1067 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 47/492 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...