./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i --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_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/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 573d04c3ab16ffed1ccac6c6179d92b670a825d7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-01 21:51:25,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 21:51:25,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 21:51:25,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 21:51:25,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 21:51:25,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 21:51:25,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 21:51:25,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 21:51:25,539 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 21:51:25,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 21:51:25,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 21:51:25,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 21:51:25,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 21:51:25,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 21:51:25,541 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 21:51:25,542 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 21:51:25,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 21:51:25,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 21:51:25,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 21:51:25,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 21:51:25,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 21:51:25,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 21:51:25,547 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 21:51:25,547 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 21:51:25,547 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 21:51:25,548 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 21:51:25,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 21:51:25,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 21:51:25,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 21:51:25,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 21:51:25,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 21:51:25,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 21:51:25,550 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 21:51:25,550 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 21:51:25,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 21:51:25,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 21:51:25,551 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-01 21:51:25,558 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 21:51:25,558 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 21:51:25,559 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 21:51:25,559 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 21:51:25,559 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-01 21:51:25,559 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-01 21:51:25,559 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-01 21:51:25,559 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-01 21:51:25,559 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-01 21:51:25,559 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-01 21:51:25,559 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-01 21:51:25,560 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-01 21:51:25,560 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-01 21:51:25,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 21:51:25,560 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 21:51:25,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 21:51:25,560 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 21:51:25,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 21:51:25,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 21:51:25,560 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 21:51:25,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 21:51:25,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 21:51:25,561 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 21:51:25,562 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-01 21:51:25,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 21:51:25,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 21:51:25,562 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-01 21:51:25,562 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_9ff74d56-d30d-4513-b5cd-3d644de181d8/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 -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2018-12-01 21:51:25,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 21:51:25,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 21:51:25,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 21:51:25,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 21:51:25,593 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 21:51:25,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-12-01 21:51:25,633 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/data/5dd6d48a3/c69acaefebb04076a3ca6026f4620557/FLAG50b687389 [2018-12-01 21:51:26,062 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 21:51:26,062 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-12-01 21:51:26,068 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/data/5dd6d48a3/c69acaefebb04076a3ca6026f4620557/FLAG50b687389 [2018-12-01 21:51:26,076 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/data/5dd6d48a3/c69acaefebb04076a3ca6026f4620557 [2018-12-01 21:51:26,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 21:51:26,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 21:51:26,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 21:51:26,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 21:51:26,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 21:51:26,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3de0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26, skipping insertion in model container [2018-12-01 21:51:26,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 21:51:26,108 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 21:51:26,255 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 21:51:26,262 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 21:51:26,319 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 21:51:26,339 INFO L195 MainTranslator]: Completed translation [2018-12-01 21:51:26,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26 WrapperNode [2018-12-01 21:51:26,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 21:51:26,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 21:51:26,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 21:51:26,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 21:51:26,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 21:51:26,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 21:51:26,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 21:51:26,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 21:51:26,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... [2018-12-01 21:51:26,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 21:51:26,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 21:51:26,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 21:51:26,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 21:51:26,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/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-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-01 21:51:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 21:51:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 21:51:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 21:51:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-01 21:51:26,408 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-01 21:51:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 21:51:26,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 21:51:26,576 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 21:51:26,576 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-01 21:51:26,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:51:26 BoogieIcfgContainer [2018-12-01 21:51:26,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 21:51:26,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 21:51:26,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 21:51:26,579 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 21:51:26,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 09:51:26" (1/3) ... [2018-12-01 21:51:26,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd7ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 09:51:26, skipping insertion in model container [2018-12-01 21:51:26,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:51:26" (2/3) ... [2018-12-01 21:51:26,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd7ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 09:51:26, skipping insertion in model container [2018-12-01 21:51:26,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:51:26" (3/3) ... [2018-12-01 21:51:26,581 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-12-01 21:51:26,586 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 21:51:26,590 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 21:51:26,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 21:51:26,615 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 21:51:26,615 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 21:51:26,615 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 21:51:26,615 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 21:51:26,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 21:51:26,616 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 21:51:26,616 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 21:51:26,616 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 21:51:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-01 21:51:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 21:51:26,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:26,629 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-01 21:51:26,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:26,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:26,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1289389462, now seen corresponding path program 1 times [2018-12-01 21:51:26,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:26,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:26,709 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-01 21:51:26,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 21:51:26,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 21:51:26,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 21:51:26,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-01 21:51:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 21:51:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 21:51:26,722 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-12-01 21:51:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:51:26,734 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-12-01 21:51:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 21:51:26,735 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-12-01 21:51:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 21:51:26,740 INFO L225 Difference]: With dead ends: 62 [2018-12-01 21:51:26,740 INFO L226 Difference]: Without dead ends: 32 [2018-12-01 21:51:26,742 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-01 21:51:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-01 21:51:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-01 21:51:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 21:51:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-12-01 21:51:26,764 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2018-12-01 21:51:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 21:51:26,764 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-12-01 21:51:26,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-01 21:51:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-12-01 21:51:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 21:51:26,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:26,765 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-01 21:51:26,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:26,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash -350572860, now seen corresponding path program 1 times [2018-12-01 21:51:26,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:26,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:26,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:26,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:26,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:26,805 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-01 21:51:26,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 21:51:26,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 21:51:26,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 21:51:26,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 21:51:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 21:51:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 21:51:26,807 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 5 states. [2018-12-01 21:51:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:51:26,841 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-12-01 21:51:26,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 21:51:26,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-01 21:51:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 21:51:26,842 INFO L225 Difference]: With dead ends: 56 [2018-12-01 21:51:26,842 INFO L226 Difference]: Without dead ends: 39 [2018-12-01 21:51:26,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 21:51:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-01 21:51:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-12-01 21:51:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-01 21:51:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2018-12-01 21:51:26,847 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 20 [2018-12-01 21:51:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 21:51:26,847 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-12-01 21:51:26,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 21:51:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-12-01 21:51:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 21:51:26,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:26,847 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:51:26,848 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:26,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:26,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2015546292, now seen corresponding path program 1 times [2018-12-01 21:51:26,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:26,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:26,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:26,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:26,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:26,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 21:51:26,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 21:51:26,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 21:51:26,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 21:51:26,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 21:51:26,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 21:51:26,882 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 3 states. [2018-12-01 21:51:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:51:26,902 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2018-12-01 21:51:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 21:51:26,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 21:51:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 21:51:26,903 INFO L225 Difference]: With dead ends: 63 [2018-12-01 21:51:26,903 INFO L226 Difference]: Without dead ends: 39 [2018-12-01 21:51:26,903 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-01 21:51:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-01 21:51:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-01 21:51:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-01 21:51:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-12-01 21:51:26,906 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 27 [2018-12-01 21:51:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 21:51:26,907 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-12-01 21:51:26,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 21:51:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-12-01 21:51:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 21:51:26,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:26,908 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:51:26,908 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:26,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1268303754, now seen corresponding path program 1 times [2018-12-01 21:51:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:26,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:26,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:26,948 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-01 21:51:26,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:26,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-01 21:51:26,949 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-01 21:51:26,950 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [14], [16], [22], [24], [27], [31], [36], [38], [42], [43], [47], [49], [54], [59], [64], [66], [69], [75], [111], [116], [117], [118], [120], [121] [2018-12-01 21:51:26,971 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-01 21:51:26,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-01 21:51:27,073 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-01 21:51:27,074 INFO L272 AbstractInterpreter]: Visited 16 different actions 23 times. Merged at 6 different actions 6 times. Never widened. Performed 223 root evaluator evaluations with a maximum evaluation depth of 3. Performed 223 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-01 21:51:27,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:27,079 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-01 21:51:27,124 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 77.2% of their original sizes. [2018-12-01 21:51:27,124 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-01 21:51:27,165 INFO L418 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-12-01 21:51:27,165 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-01 21:51:27,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 21:51:27,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-01 21:51:27,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 21:51:27,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 21:51:27,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 21:51:27,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-01 21:51:27,166 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 9 states. [2018-12-01 21:51:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:51:27,419 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2018-12-01 21:51:27,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 21:51:27,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-12-01 21:51:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 21:51:27,420 INFO L225 Difference]: With dead ends: 65 [2018-12-01 21:51:27,420 INFO L226 Difference]: Without dead ends: 48 [2018-12-01 21:51:27,420 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-01 21:51:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-01 21:51:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-12-01 21:51:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-01 21:51:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-12-01 21:51:27,425 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 27 [2018-12-01 21:51:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 21:51:27,426 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-12-01 21:51:27,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 21:51:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-12-01 21:51:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 21:51:27,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:27,427 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:51:27,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:27,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1308831546, now seen corresponding path program 1 times [2018-12-01 21:51:27,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:27,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:27,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:27,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:27,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:27,501 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-01 21:51:27,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:27,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-01 21:51:27,502 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-01 21:51:27,502 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [14], [16], [22], [24], [27], [31], [34], [36], [38], [42], [43], [47], [49], [54], [59], [64], [66], [69], [75], [111], [116], [117], [118], [120], [121] [2018-12-01 21:51:27,503 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-01 21:51:27,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-01 21:51:27,553 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-01 21:51:27,553 INFO L272 AbstractInterpreter]: Visited 28 different actions 58 times. Merged at 10 different actions 24 times. Never widened. Performed 609 root evaluator evaluations with a maximum evaluation depth of 3. Performed 609 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 27 variables. [2018-12-01 21:51:27,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:27,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-01 21:51:27,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:27,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/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-01 21:51:27,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:27,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-01 21:51:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:27,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:27,623 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-01 21:51:27,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 21:51:27,708 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-01 21:51:27,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-01 21:51:27,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-12-01 21:51:27,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-01 21:51:27,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 21:51:27,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 21:51:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-01 21:51:27,733 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 7 states. [2018-12-01 21:51:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:51:27,779 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-12-01 21:51:27,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 21:51:27,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-01 21:51:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 21:51:27,780 INFO L225 Difference]: With dead ends: 85 [2018-12-01 21:51:27,780 INFO L226 Difference]: Without dead ends: 68 [2018-12-01 21:51:27,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-01 21:51:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-01 21:51:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-12-01 21:51:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-01 21:51:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2018-12-01 21:51:27,786 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 34 [2018-12-01 21:51:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 21:51:27,787 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2018-12-01 21:51:27,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 21:51:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2018-12-01 21:51:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-01 21:51:27,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:27,788 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:51:27,788 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:27,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:27,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1450388490, now seen corresponding path program 2 times [2018-12-01 21:51:27,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:27,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:27,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:27,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:27,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:27,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-01 21:51:27,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-01 21:51:27,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-01 21:51:27,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:27,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/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-01 21:51:27,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 21:51:27,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-01 21:51:27,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-01 21:51:27,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 21:51:27,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:28,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 21:51:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:28,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-01 21:51:28,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-12-01 21:51:28,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-01 21:51:28,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 21:51:28,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 21:51:28,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-01 21:51:28,096 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 8 states. [2018-12-01 21:51:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:51:28,129 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2018-12-01 21:51:28,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 21:51:28,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-12-01 21:51:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 21:51:28,130 INFO L225 Difference]: With dead ends: 99 [2018-12-01 21:51:28,131 INFO L226 Difference]: Without dead ends: 82 [2018-12-01 21:51:28,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-01 21:51:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-01 21:51:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-12-01 21:51:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-01 21:51:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-12-01 21:51:28,135 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 41 [2018-12-01 21:51:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 21:51:28,136 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-12-01 21:51:28,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 21:51:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-12-01 21:51:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-01 21:51:28,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:28,136 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:51:28,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:28,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:28,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2080351162, now seen corresponding path program 3 times [2018-12-01 21:51:28,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:28,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:28,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:51:28,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:28,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:28,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:28,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-01 21:51:28,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-01 21:51:28,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-01 21:51:28,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:28,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/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-01 21:51:28,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-01 21:51:28,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-01 21:51:28,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-01 21:51:28,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 21:51:28,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:28,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 21:51:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:28,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-01 21:51:28,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2018-12-01 21:51:28,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-01 21:51:28,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 21:51:28,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 21:51:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-01 21:51:28,378 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 9 states. [2018-12-01 21:51:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:51:28,424 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-12-01 21:51:28,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 21:51:28,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-12-01 21:51:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 21:51:28,425 INFO L225 Difference]: With dead ends: 113 [2018-12-01 21:51:28,425 INFO L226 Difference]: Without dead ends: 96 [2018-12-01 21:51:28,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-12-01 21:51:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-01 21:51:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-12-01 21:51:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-01 21:51:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2018-12-01 21:51:28,431 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 48 [2018-12-01 21:51:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 21:51:28,431 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2018-12-01 21:51:28,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 21:51:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2018-12-01 21:51:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-01 21:51:28,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:28,432 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:51:28,432 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:28,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash -16535414, now seen corresponding path program 4 times [2018-12-01 21:51:28,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:28,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:28,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:51:28,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:28,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-01 21:51:28,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:28,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-01 21:51:28,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-01 21:51:28,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-01 21:51:28,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:51:28,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/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-01 21:51:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:28,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-01 21:51:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:28,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:28,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 21:51:28,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 21:51:28,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 21:51:28,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-01 21:51:28,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 21:51:28,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 21:51:28,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-01 21:51:28,737 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,740 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,747 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2018-12-01 21:51:28,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:28,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:28,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-12-01 21:51:28,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2018-12-01 21:51:28,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 85 [2018-12-01 21:51:28,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 21:51:28,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-12-01 21:51:28,828 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,843 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,849 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,859 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2018-12-01 21:51:28,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-01 21:51:28,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-01 21:51:28,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:28,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2018-12-01 21:51:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-01 21:51:28,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 21:51:29,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:29,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:29,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:29,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-12-01 21:51:29,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:29,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:29,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 21:51:29,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:29,422 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:29,423 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 21:51:29,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-01 21:51:29,437 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:57 [2018-12-01 21:51:31,472 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-01 21:51:31,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 21:51:31,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 21:51:31,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:4 [2018-12-01 21:51:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-01 21:51:31,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-01 21:51:31,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 30 [2018-12-01 21:51:31,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-01 21:51:31,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-01 21:51:31,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-01 21:51:31,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=770, Unknown=1, NotChecked=0, Total=870 [2018-12-01 21:51:31,535 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand 20 states. [2018-12-01 21:51:31,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:51:31,864 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2018-12-01 21:51:31,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 21:51:31,865 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-12-01 21:51:31,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 21:51:31,865 INFO L225 Difference]: With dead ends: 108 [2018-12-01 21:51:31,865 INFO L226 Difference]: Without dead ends: 95 [2018-12-01 21:51:31,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=197, Invalid=1208, Unknown=1, NotChecked=0, Total=1406 [2018-12-01 21:51:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-01 21:51:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2018-12-01 21:51:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-01 21:51:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2018-12-01 21:51:31,871 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 55 [2018-12-01 21:51:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 21:51:31,871 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-12-01 21:51:31,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-01 21:51:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2018-12-01 21:51:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-01 21:51:31,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 21:51:31,872 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:51:31,872 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 21:51:31,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:31,872 INFO L82 PathProgramCache]: Analyzing trace with hash -16533492, now seen corresponding path program 1 times [2018-12-01 21:51:31,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 21:51:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:31,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:51:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:31,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 21:51:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:51:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:51:31,940 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 21:51:31,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 09:51:31 BoogieIcfgContainer [2018-12-01 21:51:31,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 21:51:31,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 21:51:31,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 21:51:31,967 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 21:51:31,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:51:26" (3/4) ... [2018-12-01 21:51:31,968 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 21:51:32,008 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9ff74d56-d30d-4513-b5cd-3d644de181d8/bin-2019/utaipan/witness.graphml [2018-12-01 21:51:32,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 21:51:32,009 INFO L168 Benchmark]: Toolchain (without parser) took 5930.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 951.3 MB in the beginning and 836.2 MB in the end (delta: 115.1 MB). Peak memory consumption was 339.0 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:32,010 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 21:51:32,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:32,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 21:51:32,011 INFO L168 Benchmark]: Boogie Preprocessor took 18.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:32,011 INFO L168 Benchmark]: RCFGBuilder took 200.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:32,011 INFO L168 Benchmark]: TraceAbstraction took 5389.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 841.5 MB in the end (delta: 254.7 MB). Peak memory consumption was 338.6 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:32,011 INFO L168 Benchmark]: Witness Printer took 42.01 ms. Allocated memory is still 1.3 GB. Free memory is still 836.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 21:51:32,012 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5389.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 841.5 MB in the end (delta: 254.7 MB). Peak memory consumption was 338.6 MB. Max. memory is 11.5 GB. * Witness Printer took 42.01 ms. Allocated memory is still 1.3 GB. Free memory is still 836.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L585] return head; VAL [\old(len)=5, \result={54:0}, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={54:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={54:0}, head->next={69:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={54:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={54:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={54:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. UNSAFE Result, 5.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 289 SDtfs, 309 SDslu, 1064 SDs, 0 SdLazy, 466 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 450 GetRequests, 351 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9312271062271062 AbsIntWeakeningRatio, 1.2307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 0.8846153846153846 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 505 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 612 ConstructedInterpolants, 3 QuantifiedInterpolants, 102322 SizeOfPredicates, 25 NumberOfNonLiveVariables, 772 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 187/464 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...