./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.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_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/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 f18f7f1f917468e24f0e5d26966f1156107884dd ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 17:31:38,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:31:38,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:31:38,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:31:38,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:31:38,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:31:38,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:31:38,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:31:38,105 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:31:38,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:31:38,106 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:31:38,106 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:31:38,106 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:31:38,107 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:31:38,107 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:31:38,108 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:31:38,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:31:38,109 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:31:38,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:31:38,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:31:38,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:31:38,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:31:38,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:31:38,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:31:38,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:31:38,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:31:38,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:31:38,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:31:38,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:31:38,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:31:38,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:31:38,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:31:38,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:31:38,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:31:38,117 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:31:38,118 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:31:38,118 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 17:31:38,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:31:38,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:31:38,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:31:38,126 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:31:38,126 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:31:38,126 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:31:38,126 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:31:38,126 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 17:31:38,126 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:31:38,126 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:31:38,127 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 17:31:38,127 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 17:31:38,127 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:31:38,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:31:38,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:31:38,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:31:38,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:31:38,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 17:31:38,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:31:38,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:31:38,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:31:38,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:31:38,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 17:31:38,129 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 17:31:38,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:31:38,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 17:31:38,129 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 17:31:38,129 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_1e36f110-ae93-434e-b910-0eaa2c273b2f/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 -> f18f7f1f917468e24f0e5d26966f1156107884dd [2018-12-02 17:31:38,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:31:38,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:31:38,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:31:38,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:31:38,156 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:31:38,156 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i [2018-12-02 17:31:38,192 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/data/8180ee23a/41013402016647558ce3f7295fbbe158/FLAG3c13f8d87 [2018-12-02 17:31:38,574 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:31:38,575 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i [2018-12-02 17:31:38,579 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/data/8180ee23a/41013402016647558ce3f7295fbbe158/FLAG3c13f8d87 [2018-12-02 17:31:38,935 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/data/8180ee23a/41013402016647558ce3f7295fbbe158 [2018-12-02 17:31:38,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:31:38,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:31:38,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:31:38,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:31:38,953 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:31:38,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:31:38" (1/1) ... [2018-12-02 17:31:38,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8029e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:38, skipping insertion in model container [2018-12-02 17:31:38,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:31:38" (1/1) ... [2018-12-02 17:31:38,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:31:38,980 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:31:39,121 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:31:39,124 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:31:39,181 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:31:39,210 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:31:39,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39 WrapperNode [2018-12-02 17:31:39,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:31:39,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:31:39,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:31:39,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:31:39,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:31:39,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:31:39,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:31:39,229 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:31:39,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... [2018-12-02 17:31:39,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:31:39,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:31:39,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:31:39,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:31:39,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:31:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:31:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2018-12-02 17:31:39,275 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2018-12-02 17:31:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 17:31:39,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 17:31:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 17:31:39,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 17:31:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-12-02 17:31:39,275 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-12-02 17:31:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 17:31:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-12-02 17:31:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-12-02 17:31:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-12-02 17:31:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-12-02 17:31:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2018-12-02 17:31:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2018-12-02 17:31:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:31:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:31:39,420 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:31:39,420 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 17:31:39,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:31:39 BoogieIcfgContainer [2018-12-02 17:31:39,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:31:39,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 17:31:39,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 17:31:39,424 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 17:31:39,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:31:38" (1/3) ... [2018-12-02 17:31:39,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbde2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:31:39, skipping insertion in model container [2018-12-02 17:31:39,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:31:39" (2/3) ... [2018-12-02 17:31:39,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbde2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:31:39, skipping insertion in model container [2018-12-02 17:31:39,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:31:39" (3/3) ... [2018-12-02 17:31:39,426 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_false-unreach-call_1.i [2018-12-02 17:31:39,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 17:31:39,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 17:31:39,447 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 17:31:39,469 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 17:31:39,469 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 17:31:39,469 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 17:31:39,469 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:31:39,469 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:31:39,469 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 17:31:39,469 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:31:39,469 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 17:31:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-12-02 17:31:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 17:31:39,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:39,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:39,488 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:39,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash -695557442, now seen corresponding path program 1 times [2018-12-02 17:31:39,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:39,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:39,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:39,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:39,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:39,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:31:39,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:31:39,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:39,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:31:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:31:39,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:31:39,640 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-12-02 17:31:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:39,700 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2018-12-02 17:31:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:31:39,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-02 17:31:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:39,707 INFO L225 Difference]: With dead ends: 86 [2018-12-02 17:31:39,707 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 17:31:39,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:31:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 17:31:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 17:31:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 17:31:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-02 17:31:39,733 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 13 [2018-12-02 17:31:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:39,733 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-02 17:31:39,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:31:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-02 17:31:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 17:31:39,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:39,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:39,735 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:39,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash -314025953, now seen corresponding path program 1 times [2018-12-02 17:31:39,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:39,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:39,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 17:31:39,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:31:39,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:31:39,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:39,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:31:39,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:31:39,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:31:39,822 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 7 states. [2018-12-02 17:31:39,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:39,840 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-12-02 17:31:39,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:31:39,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-12-02 17:31:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:39,842 INFO L225 Difference]: With dead ends: 65 [2018-12-02 17:31:39,842 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 17:31:39,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:31:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 17:31:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 17:31:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 17:31:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-02 17:31:39,848 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 38 [2018-12-02 17:31:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:39,849 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-02 17:31:39,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:31:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-02 17:31:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 17:31:39,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:39,850 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-12-02 17:31:39,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:39,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash -607428960, now seen corresponding path program 1 times [2018-12-02 17:31:39,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:39,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:39,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 17:31:39,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:39,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:39,938 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-02 17:31:39,939 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [19], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80] [2018-12-02 17:31:39,960 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:39,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:40,109 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 17:31:40,110 INFO L272 AbstractInterpreter]: Visited 27 different actions 73 times. Merged at 9 different actions 23 times. Never widened. Performed 518 root evaluator evaluations with a maximum evaluation depth of 3. Performed 518 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 32 variables. [2018-12-02 17:31:40,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:40,117 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 17:31:40,207 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 60.5% of their original sizes. [2018-12-02 17:31:40,207 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 17:31:40,491 INFO L418 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-12-02 17:31:40,491 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 17:31:40,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:31:40,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [7] total 31 [2018-12-02 17:31:40,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:40,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 17:31:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 17:31:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-12-02 17:31:40,493 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 26 states. [2018-12-02 17:31:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:41,960 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-12-02 17:31:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 17:31:41,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-12-02 17:31:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:41,962 INFO L225 Difference]: With dead ends: 87 [2018-12-02 17:31:41,962 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 17:31:41,963 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 17:31:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 17:31:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-12-02 17:31:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 17:31:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2018-12-02 17:31:41,970 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 38 [2018-12-02 17:31:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:41,970 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2018-12-02 17:31:41,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 17:31:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2018-12-02 17:31:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 17:31:41,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:41,971 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1] [2018-12-02 17:31:41,972 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:41,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash -988491854, now seen corresponding path program 1 times [2018-12-02 17:31:41,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:41,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:41,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:41,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:41,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 17:31:42,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:42,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:42,021 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-02 17:31:42,021 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82] [2018-12-02 17:31:42,022 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:42,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:42,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:31:42,055 INFO L272 AbstractInterpreter]: Visited 35 different actions 87 times. Merged at 9 different actions 23 times. Never widened. Performed 614 root evaluator evaluations with a maximum evaluation depth of 6. Performed 614 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 33 variables. [2018-12-02 17:31:42,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:42,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:31:42,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:42,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:31:42,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:42,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:31:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:42,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:31:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 17:31:42,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:31:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:42,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:31:42,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20, 22] total 41 [2018-12-02 17:31:42,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:31:42,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 17:31:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 17:31:42,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1505, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 17:31:42,845 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand 25 states. [2018-12-02 17:31:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:43,298 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2018-12-02 17:31:43,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 17:31:43,298 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2018-12-02 17:31:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:43,299 INFO L225 Difference]: With dead ends: 120 [2018-12-02 17:31:43,299 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 17:31:43,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=2666, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 17:31:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 17:31:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-02 17:31:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 17:31:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-12-02 17:31:43,309 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 45 [2018-12-02 17:31:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:43,309 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-12-02 17:31:43,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 17:31:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-12-02 17:31:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 17:31:43,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:43,311 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1] [2018-12-02 17:31:43,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:43,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:43,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1122798515, now seen corresponding path program 1 times [2018-12-02 17:31:43,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:43,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:43,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:43,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:43,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:43,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:43,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:43,458 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-02 17:31:43,458 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82] [2018-12-02 17:31:43,459 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:43,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:43,482 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 17:31:43,482 INFO L272 AbstractInterpreter]: Visited 32 different actions 48 times. Never merged. Never widened. Performed 366 root evaluator evaluations with a maximum evaluation depth of 4. Performed 366 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-02 17:31:43,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:43,484 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 17:31:43,523 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 62.91% of their original sizes. [2018-12-02 17:31:43,523 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 17:31:43,754 INFO L418 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-12-02 17:31:43,754 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 17:31:43,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:31:43,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [19] total 47 [2018-12-02 17:31:43,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:43,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 17:31:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 17:31:43,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-12-02 17:31:43,755 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 30 states. [2018-12-02 17:31:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:45,554 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-12-02 17:31:45,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 17:31:45,554 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 45 [2018-12-02 17:31:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:45,555 INFO L225 Difference]: With dead ends: 103 [2018-12-02 17:31:45,555 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 17:31:45,556 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=2004, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 17:31:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 17:31:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-12-02 17:31:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 17:31:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2018-12-02 17:31:45,565 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 45 [2018-12-02 17:31:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:45,565 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-12-02 17:31:45,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 17:31:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-12-02 17:31:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 17:31:45,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:45,566 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1] [2018-12-02 17:31:45,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:45,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 313451889, now seen corresponding path program 1 times [2018-12-02 17:31:45,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:45,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:45,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:45,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:45,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:31:45,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:45,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:45,681 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-02 17:31:45,681 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [27], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82] [2018-12-02 17:31:45,682 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:45,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:45,703 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 17:31:45,703 INFO L272 AbstractInterpreter]: Visited 32 different actions 48 times. Never merged. Never widened. Performed 358 root evaluator evaluations with a maximum evaluation depth of 4. Performed 358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-02 17:31:45,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:45,705 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 17:31:45,731 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 62.91% of their original sizes. [2018-12-02 17:31:45,731 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 17:31:45,944 INFO L418 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-12-02 17:31:45,944 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 17:31:45,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:31:45,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [14] total 41 [2018-12-02 17:31:45,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:45,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 17:31:45,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 17:31:45,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-12-02 17:31:45,945 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 29 states. [2018-12-02 17:31:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:47,180 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-12-02 17:31:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 17:31:47,180 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2018-12-02 17:31:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:47,181 INFO L225 Difference]: With dead ends: 94 [2018-12-02 17:31:47,181 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 17:31:47,181 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=1786, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 17:31:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 17:31:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-12-02 17:31:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 17:31:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-12-02 17:31:47,187 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 45 [2018-12-02 17:31:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:47,187 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-12-02 17:31:47,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 17:31:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-12-02 17:31:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:31:47,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:47,187 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-12-02 17:31:47,188 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:47,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash 681136710, now seen corresponding path program 1 times [2018-12-02 17:31:47,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:47,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:47,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:47,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:47,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 17:31:47,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:47,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:47,334 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 17:31:47,334 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-12-02 17:31:47,336 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:47,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:47,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 17:31:47,358 INFO L272 AbstractInterpreter]: Visited 36 different actions 52 times. Never merged. Never widened. Performed 405 root evaluator evaluations with a maximum evaluation depth of 4. Performed 405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-02 17:31:47,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:47,360 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 17:31:47,396 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 64.39% of their original sizes. [2018-12-02 17:31:47,396 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 17:31:47,733 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-02 17:31:47,733 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 17:31:47,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:31:47,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [17] total 50 [2018-12-02 17:31:47,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:47,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-02 17:31:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-02 17:31:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 17:31:47,735 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 35 states. [2018-12-02 17:31:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:49,159 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-12-02 17:31:49,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 17:31:49,159 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2018-12-02 17:31:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:49,160 INFO L225 Difference]: With dead ends: 118 [2018-12-02 17:31:49,160 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 17:31:49,161 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 17:31:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 17:31:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-12-02 17:31:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 17:31:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2018-12-02 17:31:49,166 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 57 [2018-12-02 17:31:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:49,166 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2018-12-02 17:31:49,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-02 17:31:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2018-12-02 17:31:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:31:49,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:49,167 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-12-02 17:31:49,167 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:49,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -128209916, now seen corresponding path program 1 times [2018-12-02 17:31:49,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:49,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:49,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 17:31:49,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:49,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:49,321 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 17:31:49,322 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-12-02 17:31:49,323 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:49,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:49,341 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 17:31:49,341 INFO L272 AbstractInterpreter]: Visited 39 different actions 61 times. Never merged. Never widened. Performed 461 root evaluator evaluations with a maximum evaluation depth of 4. Performed 461 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-02 17:31:49,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:49,343 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 17:31:49,371 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 65.55% of their original sizes. [2018-12-02 17:31:49,371 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 17:31:49,682 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-02 17:31:49,682 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 17:31:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:31:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [20] total 55 [2018-12-02 17:31:49,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:49,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 17:31:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 17:31:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 17:31:49,683 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 37 states. [2018-12-02 17:31:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:51,413 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-12-02 17:31:51,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 17:31:51,413 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2018-12-02 17:31:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:51,413 INFO L225 Difference]: With dead ends: 121 [2018-12-02 17:31:51,413 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 17:31:51,414 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=2998, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 17:31:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 17:31:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2018-12-02 17:31:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 17:31:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-12-02 17:31:51,420 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 57 [2018-12-02 17:31:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:51,420 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-12-02 17:31:51,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 17:31:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-12-02 17:31:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:31:51,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:51,421 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:51,421 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:51,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:51,421 INFO L82 PathProgramCache]: Analyzing trace with hash 94330696, now seen corresponding path program 1 times [2018-12-02 17:31:51,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:51,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:51,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:51,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:51,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 17:31:51,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:51,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:51,535 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 17:31:51,535 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-12-02 17:31:51,536 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:51,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:51,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 17:31:51,562 INFO L272 AbstractInterpreter]: Visited 40 different actions 88 times. Merged at 4 different actions 11 times. Never widened. Performed 846 root evaluator evaluations with a maximum evaluation depth of 4. Performed 846 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-12-02 17:31:51,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:51,564 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 17:31:51,594 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 65.8% of their original sizes. [2018-12-02 17:31:51,594 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 17:31:51,917 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-02 17:31:51,917 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 17:31:51,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:31:51,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [17] total 53 [2018-12-02 17:31:51,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:51,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-02 17:31:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-02 17:31:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 17:31:51,918 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 38 states. [2018-12-02 17:31:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:53,811 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2018-12-02 17:31:53,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-02 17:31:53,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 57 [2018-12-02 17:31:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:53,812 INFO L225 Difference]: With dead ends: 165 [2018-12-02 17:31:53,812 INFO L226 Difference]: Without dead ends: 123 [2018-12-02 17:31:53,813 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=395, Invalid=3637, Unknown=0, NotChecked=0, Total=4032 [2018-12-02 17:31:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-02 17:31:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2018-12-02 17:31:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 17:31:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-12-02 17:31:53,819 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 57 [2018-12-02 17:31:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:53,819 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-02 17:31:53,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-02 17:31:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-12-02 17:31:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:31:53,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:53,820 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:53,820 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:53,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -945858366, now seen corresponding path program 1 times [2018-12-02 17:31:53,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:53,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:53,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:53,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:53,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 17:31:53,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:53,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:53,960 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 17:31:53,960 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-12-02 17:31:53,962 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:53,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:53,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:31:53,993 INFO L272 AbstractInterpreter]: Visited 42 different actions 101 times. Merged at 5 different actions 14 times. Never widened. Performed 948 root evaluator evaluations with a maximum evaluation depth of 4. Performed 948 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-12-02 17:31:53,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:53,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:31:53,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:53,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:31:54,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:54,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:31:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:54,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:31:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 17:31:54,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:31:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 17:31:54,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:31:54,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 26 [2018-12-02 17:31:54,403 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:31:54,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 17:31:54,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 17:31:54,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-12-02 17:31:54,404 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 26 states. [2018-12-02 17:31:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:54,878 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-12-02 17:31:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 17:31:54,878 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-12-02 17:31:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:54,879 INFO L225 Difference]: With dead ends: 110 [2018-12-02 17:31:54,879 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 17:31:54,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 92 SyntacticMatches, 21 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 17:31:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 17:31:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2018-12-02 17:31:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 17:31:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-12-02 17:31:54,885 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 57 [2018-12-02 17:31:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:54,886 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-12-02 17:31:54,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 17:31:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-12-02 17:31:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 17:31:54,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:54,886 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:54,886 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:54,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:54,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1081406834, now seen corresponding path program 1 times [2018-12-02 17:31:54,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:54,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:54,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:54,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:54,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:31:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 17:31:55,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:31:55,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:31:55,023 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-12-02 17:31:55,023 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-02 17:31:55,024 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:31:55,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:31:55,040 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 17:31:55,041 INFO L272 AbstractInterpreter]: Visited 41 different actions 69 times. Never merged. Never widened. Performed 519 root evaluator evaluations with a maximum evaluation depth of 4. Performed 519 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-02 17:31:55,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:55,042 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 17:31:55,071 INFO L227 lantSequenceWeakener]: Weakened 60 states. On average, predicates are now at 66.54% of their original sizes. [2018-12-02 17:31:55,072 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 17:31:55,434 INFO L418 sIntCurrentIteration]: We unified 63 AI predicates to 63 [2018-12-02 17:31:55,434 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 17:31:55,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:31:55,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [19] total 57 [2018-12-02 17:31:55,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:31:55,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 17:31:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 17:31:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 17:31:55,435 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 40 states. [2018-12-02 17:31:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:31:57,052 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2018-12-02 17:31:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-02 17:31:57,052 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 64 [2018-12-02 17:31:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:31:57,053 INFO L225 Difference]: With dead ends: 100 [2018-12-02 17:31:57,053 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 17:31:57,054 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=3218, Unknown=0, NotChecked=0, Total=3422 [2018-12-02 17:31:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 17:31:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-12-02 17:31:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 17:31:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-12-02 17:31:57,058 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 64 [2018-12-02 17:31:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:31:57,058 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-12-02 17:31:57,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 17:31:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-12-02 17:31:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 17:31:57,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:31:57,059 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:31:57,059 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:31:57,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:31:57,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1890753460, now seen corresponding path program 1 times [2018-12-02 17:31:57,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:31:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:57,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:31:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:31:57,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:31:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:31:57,095 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 17:31:57,125 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2018-12-02 17:31:57,126 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2018-12-02 17:31:57,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:31:57 BoogieIcfgContainer [2018-12-02 17:31:57,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 17:31:57,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:31:57,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:31:57,140 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:31:57,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:31:39" (3/4) ... [2018-12-02 17:31:57,141 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 17:31:57,147 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2018-12-02 17:31:57,147 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2018-12-02 17:31:57,184 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1e36f110-ae93-434e-b910-0eaa2c273b2f/bin-2019/utaipan/witness.graphml [2018-12-02 17:31:57,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:31:57,185 INFO L168 Benchmark]: Toolchain (without parser) took 18243.03 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 557.8 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -67.4 MB). Peak memory consumption was 490.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:57,185 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:31:57,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -111.2 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:57,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:31:57,186 INFO L168 Benchmark]: Boogie Preprocessor took 13.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:57,186 INFO L168 Benchmark]: RCFGBuilder took 178.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:57,186 INFO L168 Benchmark]: TraceAbstraction took 17717.87 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 474.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.9 MB). Peak memory consumption was 491.8 MB. Max. memory is 11.5 GB. [2018-12-02 17:31:57,186 INFO L168 Benchmark]: Witness Printer took 44.64 ms. Allocated memory is still 1.6 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:31:57,188 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -111.2 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17717.87 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 474.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.9 MB). Peak memory consumption was 491.8 MB. Max. memory is 11.5 GB. * Witness Printer took 44.64 ms. Allocated memory is still 1.6 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L867] void * guard_malloc_counter = 0; [L887] struct list_head *elem = ((void *)0); [L900] static struct list_head head; VAL [\old(elem)=9, \old(elem)=14, \old(guard_malloc_counter)=12, \old(guard_malloc_counter)=11, \old(head)=null, \old(head)=null, elem={0:0}, guard_malloc_counter={0:0}, head={15:0}] [L903] struct list_head *dev1, *dev2; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:0}, head={15:0}] [L904] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={15:0}] [L879] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={15:0}] [L871] (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={15:0}, size=8] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={15:0}, size=8] [L879] RET, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, __getMemory(size)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={15:0}, size=8] [L879] return __getMemory(size); [L904] RET, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:1}, head={15:0}, my_malloc(sizeof(*dev1))={0:1}] [L904] dev1 = my_malloc(sizeof(*dev1)) [L905] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={15:0}] [L879] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={15:0}] [L871] (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={15:0}, size=8] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, \result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={15:0}, size=8] [L879] RET, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, __getMemory(size)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={15:0}, size=8] [L879] return __getMemory(size); [L905] RET, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={15:0}, my_malloc(sizeof(*dev2))={0:2}] [L905] dev2 = my_malloc(sizeof(*dev2)) [L906] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={15:0}] [L907] CALL list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, new={0:2}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, head={15:0}, new={0:2}, new={0:2}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:2}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, head={15:0}, new={0:2}, new={0:2}] [L907] RET list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={15:0}] [L908] CALL list_add(dev1, &head) VAL [\old(elem)=2, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:2}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, new={0:1}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=2, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:2}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, head={15:0}, new={0:1}, new={0:1}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [\old(elem)=2, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, head={15:0}, new={0:1}, new={0:1}] [L908] RET list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}] [L909] CALL list_del(dev2) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, guard_malloc_counter={0:2}, head={15:0}] [L896] COND FALSE !(entry==elem) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, entry={0:2}, guard_malloc_counter={0:2}, head={15:0}] [L909] RET list_del(dev2) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}] [L910] CALL list_add(dev2, &head) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, new={0:2}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, head={15:0}, new={0:2}, new={0:2}] [L891] COND FALSE !(__VERIFIER_nondet_int()) [L910] RET list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}] [L913] CALL list_add(dev1, &head) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, new={0:1}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}, head={15:0}, head={15:0}, new={0:1}, new={0:1}] [L890] CALL __blast_assert () VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}] [L6] __VERIFIER_error() VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 48 locations, 1 error locations. UNSAFE Result, 17.6s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 467 SDtfs, 709 SDslu, 3623 SDs, 0 SdLazy, 4335 SolverSat, 516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 773 GetRequests, 288 SyntacticMatches, 26 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5835 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 9 AbstIntIterations, 7 AbstIntStrong, 0.9376152414937994 AbsIntWeakeningRatio, 1.3651685393258426 AbsIntAvgWeakeningVarsNumRemoved, 11.047752808988765 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 107 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 112654 SizeOfPredicates, 15 NumberOfNonLiveVariables, 575 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 167/248 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...