./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45294379b83c6b60e0b0199955cdf7244f057430 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-02 21:09:34,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:09:34,971 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:09:34,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:09:34,980 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:09:34,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:09:34,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:09:34,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:09:34,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:09:34,984 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:09:34,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:09:34,985 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:09:34,985 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:09:34,986 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:09:34,987 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:09:34,987 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:09:34,988 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:09:34,989 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:09:34,990 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:09:34,991 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:09:34,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:09:34,993 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:09:34,994 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:09:34,995 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:09:34,995 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:09:34,995 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:09:34,996 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:09:34,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:09:34,997 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:09:34,998 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:09:34,998 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:09:34,998 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:09:34,999 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:09:34,999 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:09:34,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:09:35,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:09:35,000 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 21:09:35,010 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:09:35,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:09:35,011 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:09:35,011 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:09:35,011 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:09:35,011 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:09:35,011 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:09:35,011 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:09:35,012 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:09:35,012 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:09:35,012 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:09:35,012 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:09:35,012 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:09:35,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:09:35,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:09:35,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:09:35,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:09:35,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:09:35,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:09:35,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:09:35,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:09:35,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:09:35,014 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:09:35,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:09:35,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:09:35,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:09:35,014 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:09:35,014 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:09:35,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:09:35,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:09:35,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:09:35,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:09:35,015 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:09:35,015 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:09:35,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:09:35,015 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:09:35,016 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan 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 -> Taipan 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 -> 45294379b83c6b60e0b0199955cdf7244f057430 [2018-12-02 21:09:35,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:09:35,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:09:35,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:09:35,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:09:35,053 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:09:35,055 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c [2018-12-02 21:09:35,102 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/data/6c820a677/0f9db7a74a504c0e97d5a3ffbe101880/FLAGa83ecc45c [2018-12-02 21:09:35,397 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:09:35,397 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c [2018-12-02 21:09:35,400 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/data/6c820a677/0f9db7a74a504c0e97d5a3ffbe101880/FLAGa83ecc45c [2018-12-02 21:09:35,408 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/data/6c820a677/0f9db7a74a504c0e97d5a3ffbe101880 [2018-12-02 21:09:35,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:09:35,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:09:35,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:09:35,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:09:35,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:09:35,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c1f7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35, skipping insertion in model container [2018-12-02 21:09:35,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:09:35,430 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:09:35,521 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:09:35,527 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:09:35,538 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:09:35,546 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:09:35,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35 WrapperNode [2018-12-02 21:09:35,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:09:35,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:09:35,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:09:35,547 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:09:35,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:09:35,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:09:35,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:09:35,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:09:35,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... [2018-12-02 21:09:35,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:09:35,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:09:35,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:09:35,608 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:09:35,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/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-12-02 21:09:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:09:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:09:35,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:09:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:09:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:09:35,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:09:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:09:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:09:35,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:09:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-02 21:09:35,640 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-02 21:09:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:09:35,739 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:09:35,739 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 21:09:35,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:09:35 BoogieIcfgContainer [2018-12-02 21:09:35,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:09:35,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:09:35,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:09:35,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:09:35,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:09:35" (1/3) ... [2018-12-02 21:09:35,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7884959d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:09:35, skipping insertion in model container [2018-12-02 21:09:35,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:09:35" (2/3) ... [2018-12-02 21:09:35,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7884959d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:09:35, skipping insertion in model container [2018-12-02 21:09:35,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:09:35" (3/3) ... [2018-12-02 21:09:35,744 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_false-unreach-call.c [2018-12-02 21:09:35,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:09:35,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 21:09:35,763 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 21:09:35,780 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:09:35,780 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:09:35,780 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:09:35,780 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:09:35,780 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:09:35,780 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:09:35,780 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:09:35,780 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:09:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-02 21:09:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 21:09:35,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:35,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:35,795 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:35,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 855240046, now seen corresponding path program 1 times [2018-12-02 21:09:35,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:35,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:35,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:35,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:35,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:35,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:09:35,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:09:35,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:09:35,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 21:09:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 21:09:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 21:09:35,883 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-12-02 21:09:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:35,893 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-12-02 21:09:35,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 21:09:35,894 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-12-02 21:09:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:35,900 INFO L225 Difference]: With dead ends: 42 [2018-12-02 21:09:35,900 INFO L226 Difference]: Without dead ends: 20 [2018-12-02 21:09:35,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 21:09:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-02 21:09:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 21:09:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 21:09:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-02 21:09:35,922 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-12-02 21:09:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:35,922 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-02 21:09:35,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 21:09:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-02 21:09:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 21:09:35,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:35,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:35,923 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:35,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1631497781, now seen corresponding path program 1 times [2018-12-02 21:09:35,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:35,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:35,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:35,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:09:35,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:09:35,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:09:35,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:09:35,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:09:35,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:09:35,961 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-12-02 21:09:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:35,971 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-02 21:09:35,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:09:35,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 21:09:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:35,972 INFO L225 Difference]: With dead ends: 34 [2018-12-02 21:09:35,972 INFO L226 Difference]: Without dead ends: 22 [2018-12-02 21:09:35,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:09:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-02 21:09:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 21:09:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 21:09:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 21:09:35,975 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-02 21:09:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:35,975 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 21:09:35,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:09:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-02 21:09:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:09:35,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:35,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:35,976 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:35,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1934775405, now seen corresponding path program 1 times [2018-12-02 21:09:35,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:35,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:35,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:35,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:35,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:36,008 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-02 21:09:36,009 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [19], [22], [27], [30], [37], [40], [47], [50], [51], [52], [53], [54], [56], [57] [2018-12-02 21:09:36,028 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:09:36,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:09:36,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:09:36,132 INFO L272 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 2 different actions 4 times. Never widened. Performed 170 root evaluator evaluations with a maximum evaluation depth of 5. Performed 170 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-02 21:09:36,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:36,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:09:36,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/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-12-02 21:09:36,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:36,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:09:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:36,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:36,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 21:09:36,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:36,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:09:36,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:09:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:09:36,216 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-12-02 21:09:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:36,230 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-02 21:09:36,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:09:36,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 21:09:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:36,231 INFO L225 Difference]: With dead ends: 36 [2018-12-02 21:09:36,231 INFO L226 Difference]: Without dead ends: 24 [2018-12-02 21:09:36,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:09:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-02 21:09:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-02 21:09:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 21:09:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-02 21:09:36,234 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-02 21:09:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:36,234 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 21:09:36,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:09:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-02 21:09:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 21:09:36,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:36,235 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:36,235 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:36,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1739404943, now seen corresponding path program 2 times [2018-12-02 21:09:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:36,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:36,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:36,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/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-12-02 21:09:36,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:09:36,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:09:36,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:09:36,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:36,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:36,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 21:09:36,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:36,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:09:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:09:36,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:09:36,354 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-12-02 21:09:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:36,366 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-12-02 21:09:36,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:09:36,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-02 21:09:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:36,367 INFO L225 Difference]: With dead ends: 38 [2018-12-02 21:09:36,367 INFO L226 Difference]: Without dead ends: 26 [2018-12-02 21:09:36,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:09:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-02 21:09:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-02 21:09:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 21:09:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-02 21:09:36,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-02 21:09:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:36,370 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-02 21:09:36,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:09:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-02 21:09:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:09:36,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:36,371 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:36,371 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:36,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1328015311, now seen corresponding path program 3 times [2018-12-02 21:09:36,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:36,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:36,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:36,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/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-12-02 21:09:36,409 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:09:36,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:09:36,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:09:36,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:36,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:36,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 21:09:36,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:36,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:09:36,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:09:36,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:09:36,492 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-12-02 21:09:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:36,508 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-12-02 21:09:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:09:36,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 21:09:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:36,508 INFO L225 Difference]: With dead ends: 40 [2018-12-02 21:09:36,508 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 21:09:36,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:09:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 21:09:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-02 21:09:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 21:09:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-02 21:09:36,511 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-02 21:09:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:36,511 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-02 21:09:36,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:09:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-02 21:09:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 21:09:36,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:36,512 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:36,512 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:36,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1523652947, now seen corresponding path program 4 times [2018-12-02 21:09:36,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:36,551 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:36,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:36,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/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-12-02 21:09:36,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:36,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:09:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:36,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:36,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 21:09:36,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:36,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:09:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:09:36,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:09:36,671 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-12-02 21:09:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:36,691 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-02 21:09:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:09:36,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-02 21:09:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:36,692 INFO L225 Difference]: With dead ends: 42 [2018-12-02 21:09:36,693 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 21:09:36,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:09:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 21:09:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-02 21:09:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 21:09:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-02 21:09:36,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-02 21:09:36,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:36,697 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-02 21:09:36,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:09:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-02 21:09:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 21:09:36,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:36,697 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:36,698 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:36,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1787714037, now seen corresponding path program 5 times [2018-12-02 21:09:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:36,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:36,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:36,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/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-12-02 21:09:36,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:09:36,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:09:36,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 21:09:36,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:36,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:36,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 21:09:36,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:36,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:09:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:09:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:09:36,889 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-12-02 21:09:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:36,909 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-02 21:09:36,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:09:36,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-02 21:09:36,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:36,910 INFO L225 Difference]: With dead ends: 44 [2018-12-02 21:09:36,910 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 21:09:36,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:09:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 21:09:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-02 21:09:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 21:09:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-02 21:09:36,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-02 21:09:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:36,913 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-02 21:09:36,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:09:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-02 21:09:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:09:36,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:36,913 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:36,914 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:36,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2147351063, now seen corresponding path program 6 times [2018-12-02 21:09:36,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:36,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:36,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:36,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:36,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:36,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/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-12-02 21:09:36,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:09:36,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:09:36,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:09:36,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:36,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:36,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:37,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 21:09:37,078 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:37,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:09:37,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:09:37,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:09:37,079 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-12-02 21:09:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:37,100 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-12-02 21:09:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:09:37,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-12-02 21:09:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:37,101 INFO L225 Difference]: With dead ends: 46 [2018-12-02 21:09:37,101 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 21:09:37,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:09:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 21:09:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-02 21:09:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 21:09:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-02 21:09:37,104 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-02 21:09:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:37,104 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-02 21:09:37,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:09:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-02 21:09:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:09:37,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:37,105 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:37,105 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:37,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:37,105 INFO L82 PathProgramCache]: Analyzing trace with hash -133817927, now seen corresponding path program 7 times [2018-12-02 21:09:37,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:37,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:37,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:37,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:37,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:37,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:37,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:37,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:37,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:37,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:37,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:37,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:09:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:37,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:37,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 21:09:37,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:37,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:09:37,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:09:37,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-02 21:09:37,284 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-12-02 21:09:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:37,303 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-02 21:09:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:09:37,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-02 21:09:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:37,304 INFO L225 Difference]: With dead ends: 48 [2018-12-02 21:09:37,304 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 21:09:37,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-02 21:09:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 21:09:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-02 21:09:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 21:09:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-02 21:09:37,308 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-02 21:09:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:37,308 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-02 21:09:37,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:09:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-02 21:09:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 21:09:37,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:37,309 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:37,309 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:37,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1903896357, now seen corresponding path program 8 times [2018-12-02 21:09:37,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:37,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:37,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:37,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:37,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:37,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:37,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:37,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:37,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:37,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:37,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:09:37,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:09:37,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 21:09:37,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:37,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:37,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 21:09:37,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:37,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:09:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:09:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:09:37,582 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-12-02 21:09:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:37,604 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-02 21:09:37,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:09:37,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-12-02 21:09:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:37,605 INFO L225 Difference]: With dead ends: 50 [2018-12-02 21:09:37,605 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 21:09:37,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:09:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 21:09:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-02 21:09:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 21:09:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-02 21:09:37,607 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-02 21:09:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:37,608 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-02 21:09:37,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:09:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-02 21:09:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:09:37,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:37,608 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:37,609 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:37,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:37,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2142218371, now seen corresponding path program 9 times [2018-12-02 21:09:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:37,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:37,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:37,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:37,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:37,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:37,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:37,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:37,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:37,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:37,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:09:37,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:09:37,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:09:37,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:37,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:37,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-02 21:09:37,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:37,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:09:37,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:09:37,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:37,801 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-12-02 21:09:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:37,825 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-02 21:09:37,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:09:37,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-12-02 21:09:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:37,826 INFO L225 Difference]: With dead ends: 52 [2018-12-02 21:09:37,826 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 21:09:37,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 21:09:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-12-02 21:09:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 21:09:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-02 21:09:37,829 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-02 21:09:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:37,829 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-02 21:09:37,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:09:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-02 21:09:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 21:09:37,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:37,830 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:37,830 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:37,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash 758560159, now seen corresponding path program 10 times [2018-12-02 21:09:37,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:37,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:37,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:37,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:37,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:37,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:37,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:37,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:37,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:37,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:37,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:09:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:37,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:37,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:38,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-12-02 21:09:38,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:38,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 21:09:38,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 21:09:38,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:38,061 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 14 states. [2018-12-02 21:09:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:38,083 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-12-02 21:09:38,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:09:38,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-12-02 21:09:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:38,084 INFO L225 Difference]: With dead ends: 54 [2018-12-02 21:09:38,084 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 21:09:38,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 21:09:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-02 21:09:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 21:09:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-02 21:09:38,088 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-02 21:09:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:38,088 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-02 21:09:38,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 21:09:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-02 21:09:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:09:38,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:38,089 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:38,089 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:38,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash 972952385, now seen corresponding path program 11 times [2018-12-02 21:09:38,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:38,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:38,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:38,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:38,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:38,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:38,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:38,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:09:38,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:09:38,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-02 21:09:38,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:38,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:38,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2018-12-02 21:09:38,504 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:38,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 21:09:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:09:38,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:38,505 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2018-12-02 21:09:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:38,529 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-02 21:09:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:09:38,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-12-02 21:09:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:38,529 INFO L225 Difference]: With dead ends: 56 [2018-12-02 21:09:38,529 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 21:09:38,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 21:09:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-02 21:09:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 21:09:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-02 21:09:38,533 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-02 21:09:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:38,533 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-02 21:09:38,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 21:09:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-02 21:09:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 21:09:38,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:38,534 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:38,534 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:38,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:38,534 INFO L82 PathProgramCache]: Analyzing trace with hash 845451363, now seen corresponding path program 12 times [2018-12-02 21:09:38,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:38,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:38,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:38,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:38,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:38,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:38,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:38,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:38,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:38,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:38,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:09:38,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:09:38,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:09:38,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:38,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:38,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2018-12-02 21:09:38,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:38,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 21:09:38,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 21:09:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:38,762 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 16 states. [2018-12-02 21:09:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:38,788 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-02 21:09:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:09:38,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-12-02 21:09:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:38,788 INFO L225 Difference]: With dead ends: 58 [2018-12-02 21:09:38,788 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 21:09:38,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 21:09:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-02 21:09:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 21:09:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-02 21:09:38,790 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-02 21:09:38,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:38,791 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-02 21:09:38,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 21:09:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-02 21:09:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 21:09:38,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:38,791 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:38,791 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:38,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:38,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1423946491, now seen corresponding path program 13 times [2018-12-02 21:09:38,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:38,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:38,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:38,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:38,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:38,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:38,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:38,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:38,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:38,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:09:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:38,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:38,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:39,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:39,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2018-12-02 21:09:39,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:39,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:09:39,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:09:39,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:39,025 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2018-12-02 21:09:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:39,060 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-02 21:09:39,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:09:39,060 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-02 21:09:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:39,060 INFO L225 Difference]: With dead ends: 60 [2018-12-02 21:09:39,061 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 21:09:39,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 21:09:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-12-02 21:09:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 21:09:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-02 21:09:39,064 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-02 21:09:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:39,064 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-02 21:09:39,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:09:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-02 21:09:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 21:09:39,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:39,064 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:39,064 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:39,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash -471897817, now seen corresponding path program 14 times [2018-12-02 21:09:39,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:39,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:39,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:39,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:39,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:39,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:39,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:39,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:39,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:39,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:39,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:39,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:09:39,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:09:40,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-02 21:09:40,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:40,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:40,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:40,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:40,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2018-12-02 21:09:40,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:40,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 21:09:40,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 21:09:40,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:40,483 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 18 states. [2018-12-02 21:09:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:40,520 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-02 21:09:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 21:09:40,520 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-02 21:09:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:40,521 INFO L225 Difference]: With dead ends: 62 [2018-12-02 21:09:40,521 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 21:09:40,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 21:09:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-02 21:09:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 21:09:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-02 21:09:40,523 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-02 21:09:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:40,523 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-02 21:09:40,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 21:09:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-02 21:09:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:09:40,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:40,524 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:40,524 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:40,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash -381156151, now seen corresponding path program 15 times [2018-12-02 21:09:40,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:40,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:40,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:40,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:40,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:40,608 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:40,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:40,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:40,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:40,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:09:40,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:09:40,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:09:40,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:40,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:40,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:40,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 23 [2018-12-02 21:09:40,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:40,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 21:09:40,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 21:09:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:40,804 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2018-12-02 21:09:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:40,831 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-12-02 21:09:40,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 21:09:40,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-02 21:09:40,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:40,831 INFO L225 Difference]: With dead ends: 64 [2018-12-02 21:09:40,831 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 21:09:40,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 21:09:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-12-02 21:09:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 21:09:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-02 21:09:40,835 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-02 21:09:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:40,835 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-02 21:09:40,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 21:09:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-02 21:09:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 21:09:40,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:40,836 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:40,836 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:40,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:40,836 INFO L82 PathProgramCache]: Analyzing trace with hash 922238955, now seen corresponding path program 16 times [2018-12-02 21:09:40,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:40,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:40,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:40,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:40,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:40,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:40,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:40,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:40,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:40,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:40,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:40,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:40,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:09:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:40,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:40,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:41,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:41,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2018-12-02 21:09:41,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:41,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 21:09:41,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 21:09:41,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:41,096 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 20 states. [2018-12-02 21:09:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:41,129 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-02 21:09:41,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 21:09:41,130 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-12-02 21:09:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:41,130 INFO L225 Difference]: With dead ends: 66 [2018-12-02 21:09:41,130 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 21:09:41,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 21:09:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-02 21:09:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 21:09:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-02 21:09:41,132 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-02 21:09:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:41,132 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-02 21:09:41,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 21:09:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-02 21:09:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 21:09:41,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:41,133 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:41,133 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:41,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash -645514611, now seen corresponding path program 17 times [2018-12-02 21:09:41,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:41,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:41,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:41,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:41,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:41,244 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:41,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:41,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:41,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:41,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:09:41,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:09:44,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-02 21:09:44,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:44,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:44,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 23 [2018-12-02 21:09:44,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:44,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 21:09:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 21:09:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:44,672 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 21 states. [2018-12-02 21:09:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:44,704 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-02 21:09:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 21:09:44,704 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-02 21:09:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:44,705 INFO L225 Difference]: With dead ends: 68 [2018-12-02 21:09:44,705 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 21:09:44,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 21:09:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-02 21:09:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 21:09:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-02 21:09:44,707 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-02 21:09:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:44,707 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-02 21:09:44,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 21:09:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-02 21:09:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 21:09:44,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:44,707 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:44,708 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:44,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:44,708 INFO L82 PathProgramCache]: Analyzing trace with hash 276829359, now seen corresponding path program 18 times [2018-12-02 21:09:44,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:44,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:44,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:44,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:44,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:44,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:44,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:44,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:44,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:44,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:09:44,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:09:44,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:09:44,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:09:44,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:44,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:45,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:45,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 23 [2018-12-02 21:09:45,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:45,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 21:09:45,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 21:09:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:45,005 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 22 states. [2018-12-02 21:09:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:45,038 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-12-02 21:09:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 21:09:45,038 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-12-02 21:09:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:45,039 INFO L225 Difference]: With dead ends: 70 [2018-12-02 21:09:45,039 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 21:09:45,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 18 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 21:09:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-02 21:09:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 21:09:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-02 21:09:45,040 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-02 21:09:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:45,041 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-02 21:09:45,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 21:09:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-02 21:09:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:09:45,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:45,041 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:45,041 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:45,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1886121553, now seen corresponding path program 19 times [2018-12-02 21:09:45,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:45,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:09:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:45,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:45,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:45,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:09:45,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:09:45,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:09:45,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:09:45,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:09:45,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:45,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:09:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:09:45,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:09:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:45,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:09:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:09:45,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:09:45,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 23 [2018-12-02 21:09:45,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:09:45,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 21:09:45,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 21:09:45,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:45,327 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 23 states. [2018-12-02 21:09:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:45,367 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-02 21:09:45,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 21:09:45,367 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-12-02 21:09:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:45,368 INFO L225 Difference]: With dead ends: 71 [2018-12-02 21:09:45,368 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 21:09:45,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:09:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 21:09:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 21:09:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 21:09:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-02 21:09:45,371 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-02 21:09:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:45,372 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-02 21:09:45,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 21:09:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-02 21:09:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:09:45,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:45,372 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:45,373 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:09:45,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2067273869, now seen corresponding path program 20 times [2018-12-02 21:09:45,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:09:45,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:45,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:45,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:45,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:09:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:09:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:09:45,452 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 21:09:45,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:09:45 BoogieIcfgContainer [2018-12-02 21:09:45,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:09:45,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:09:45,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:09:45,477 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:09:45,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:09:35" (3/4) ... [2018-12-02 21:09:45,479 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 21:09:45,521 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d349ef0e-e197-4a24-b1a8-bed7a3bf9dba/bin-2019/utaipan/witness.graphml [2018-12-02 21:09:45,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:09:45,521 INFO L168 Benchmark]: Toolchain (without parser) took 10110.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 949.7 MB in the beginning and 820.8 MB in the end (delta: 128.9 MB). Peak memory consumption was 318.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:45,522 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:09:45,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.21 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 938.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:45,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.02 ms. Allocated memory is still 1.0 GB. Free memory is still 938.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:09:45,523 INFO L168 Benchmark]: Boogie Preprocessor took 46.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:45,523 INFO L168 Benchmark]: RCFGBuilder took 131.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:45,524 INFO L168 Benchmark]: TraceAbstraction took 9736.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 97.0 MB). Free memory was 1.1 GB in the beginning and 820.8 MB in the end (delta: 253.0 MB). Peak memory consumption was 350.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:45,524 INFO L168 Benchmark]: Witness Printer took 43.65 ms. Allocated memory is still 1.2 GB. Free memory is still 820.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:09:45,525 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.21 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 938.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.02 ms. Allocated memory is still 1.0 GB. Free memory is still 938.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 131.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9736.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 97.0 MB). Free memory was 1.1 GB in the beginning and 820.8 MB in the end (delta: 253.0 MB). Peak memory consumption was 350.0 MB. Max. memory is 11.5 GB. * Witness Printer took 43.65 ms. Allocated memory is still 1.2 GB. Free memory is still 820.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={162:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={162:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={162:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={162:0}, ad2={162:0}, check(ad1, i)=0, i=10, j=20, pa={162:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 9.7s OverallTime, 22 OverallIterations, 20 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 210 SDslu, 3009 SDs, 0 SdLazy, 658 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1677 GetRequests, 1239 SyntacticMatches, 110 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 2142 ConstructedInterpolants, 0 QuantifiedInterpolants, 187710 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3059 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 59 InterpolantComputations, 2 PerfectInterpolantSequences, 0/7410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...