./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/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 f345f307410a5ddbdd0513896d69ca703c67be23 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:51:16,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:51:16,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:51:16,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:51:16,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:51:16,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:51:16,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:51:16,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:51:16,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:51:16,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:51:16,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:51:16,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:51:16,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:51:16,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:51:16,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:51:16,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:51:16,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:51:16,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:51:16,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:51:16,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:51:16,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:51:16,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:51:16,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:51:16,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:51:16,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:51:16,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:51:16,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:51:16,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:51:16,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:51:16,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:51:16,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:51:16,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:51:16,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:51:16,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:51:16,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:51:16,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:51:16,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:51:16,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:51:16,145 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:51:16,146 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:51:16,146 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:51:16,146 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:51:16,146 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:51:16,146 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:51:16,147 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:51:16,147 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:51:16,147 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:51:16,147 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:51:16,147 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:51:16,147 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:51:16,147 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:51:16,147 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:51:16,147 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:51:16,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:51:16,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:51:16,149 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:51:16,149 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:51:16,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:51:16,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:51:16,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:51:16,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:51:16,149 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:51:16,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:51:16,150 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:51:16,150 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:51:16,150 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_57e39d7d-201c-4ae8-a937-e3edc44f1377/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 -> f345f307410a5ddbdd0513896d69ca703c67be23 [2018-11-18 17:51:16,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:51:16,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:51:16,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:51:16,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:51:16,188 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:51:16,188 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-11-18 17:51:16,233 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/data/058e88825/ca957ada1b854f0db3697cac62e12ede/FLAGd5c8fde86 [2018-11-18 17:51:16,590 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:51:16,590 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/sv-benchmarks/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-11-18 17:51:16,596 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/data/058e88825/ca957ada1b854f0db3697cac62e12ede/FLAGd5c8fde86 [2018-11-18 17:51:17,004 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/data/058e88825/ca957ada1b854f0db3697cac62e12ede [2018-11-18 17:51:17,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:51:17,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:51:17,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:51:17,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:51:17,012 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:51:17,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263ee91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17, skipping insertion in model container [2018-11-18 17:51:17,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:51:17,035 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:51:17,148 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:51:17,150 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:51:17,161 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:51:17,170 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:51:17,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17 WrapperNode [2018-11-18 17:51:17,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:51:17,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:51:17,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:51:17,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:51:17,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:51:17,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:51:17,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:51:17,184 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:51:17,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... [2018-11-18 17:51:17,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:51:17,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:51:17,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:51:17,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:51:17,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/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-11-18 17:51:17,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:51:17,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:51:17,281 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-18 17:51:17,281 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-18 17:51:17,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:51:17,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:51:17,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:51:17,281 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:51:17,282 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-18 17:51:17,282 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-18 17:51:17,410 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:51:17,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:51:17 BoogieIcfgContainer [2018-11-18 17:51:17,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:51:17,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:51:17,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:51:17,414 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:51:17,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:51:17" (1/3) ... [2018-11-18 17:51:17,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531a8756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:51:17, skipping insertion in model container [2018-11-18 17:51:17,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:51:17" (2/3) ... [2018-11-18 17:51:17,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531a8756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:51:17, skipping insertion in model container [2018-11-18 17:51:17,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:51:17" (3/3) ... [2018-11-18 17:51:17,417 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-11-18 17:51:17,425 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:51:17,430 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:51:17,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:51:17,468 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:51:17,468 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:51:17,468 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:51:17,468 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:51:17,468 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:51:17,469 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:51:17,469 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:51:17,469 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:51:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-18 17:51:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 17:51:17,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:51:17,488 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:51:17,490 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:51:17,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-11-18 17:51:17,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:51:17,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:17,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:51:17,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:17,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:51:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:51:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:51:17,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:51:17,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:51:17,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:51:17,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:51:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:51:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:17,717 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-18 17:51:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:51:17,762 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-18 17:51:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:51:17,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 17:51:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:51:17,769 INFO L225 Difference]: With dead ends: 40 [2018-11-18 17:51:17,769 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 17:51:17,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 17:51:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 17:51:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 17:51:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-18 17:51:17,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-18 17:51:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:51:17,804 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-18 17:51:17,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:51:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-18 17:51:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 17:51:17,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:51:17,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:51:17,806 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:51:17,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-11-18 17:51:17,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:51:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:17,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:51:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:17,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:51:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:51:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:51:17,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:51:17,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:51:17,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:51:17,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:51:17,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:51:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:17,901 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-18 17:51:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:51:17,987 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-18 17:51:17,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:51:17,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 17:51:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:51:17,988 INFO L225 Difference]: With dead ends: 44 [2018-11-18 17:51:17,989 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 17:51:17,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 17:51:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 17:51:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 17:51:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-18 17:51:17,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-18 17:51:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:51:17,995 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 17:51:17,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:51:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 17:51:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 17:51:17,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:51:17,996 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:51:17,996 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:51:17,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:17,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-11-18 17:51:17,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:51:17,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:17,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:51:17,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:17,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:51:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:51:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:51:18,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:51:18,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 17:51:18,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:51:18,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 17:51:18,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:51:18,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:51:18,166 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-18 17:51:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:51:18,205 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 17:51:18,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:51:18,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 17:51:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:51:18,206 INFO L225 Difference]: With dead ends: 36 [2018-11-18 17:51:18,206 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 17:51:18,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:51:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 17:51:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 17:51:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 17:51:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-18 17:51:18,210 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-18 17:51:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:51:18,210 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 17:51:18,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 17:51:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 17:51:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:51:18,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:51:18,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:51:18,211 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:51:18,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:18,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-11-18 17:51:18,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:51:18,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:18,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:51:18,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:18,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:51:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:51:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:51:18,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:51:18,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:51:18,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:51:18,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:51:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:51:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:18,296 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-18 17:51:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:51:18,312 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-18 17:51:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:51:18,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 17:51:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:51:18,314 INFO L225 Difference]: With dead ends: 48 [2018-11-18 17:51:18,314 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 17:51:18,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 17:51:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 17:51:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 17:51:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-18 17:51:18,319 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-18 17:51:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:51:18,320 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 17:51:18,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:51:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-18 17:51:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:51:18,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:51:18,320 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:51:18,321 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:51:18,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-11-18 17:51:18,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:51:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:18,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:51:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:18,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:51:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:51:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:51:18,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:51:18,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:51:18,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:51:18,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:51:18,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:51:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:18,397 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-18 17:51:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:51:18,406 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-18 17:51:18,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:51:18,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 17:51:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:51:18,407 INFO L225 Difference]: With dead ends: 40 [2018-11-18 17:51:18,407 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 17:51:18,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:18,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 17:51:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 17:51:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 17:51:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-18 17:51:18,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-18 17:51:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:51:18,412 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 17:51:18,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:51:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-18 17:51:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:51:18,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:51:18,413 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:51:18,413 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:51:18,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-11-18 17:51:18,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:51:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:18,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:51:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:18,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:51:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:51:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:51:18,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:51:18,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:51:18,559 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-18 17:51:18,560 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [11], [12], [16], [18], [21], [23], [29], [32], [33], [35], [39], [40], [41], [42], [43], [44], [45], [47], [48], [49], [50] [2018-11-18 17:51:18,583 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:51:18,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:51:18,689 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 17:51:18,690 INFO L272 AbstractInterpreter]: Visited 24 different actions 52 times. Merged at 6 different actions 8 times. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 4. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-18 17:51:18,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:18,698 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 17:51:18,745 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 60% of their original sizes. [2018-11-18 17:51:18,746 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 17:51:18,827 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-11-18 17:51:18,827 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 17:51:18,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:51:18,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2018-11-18 17:51:18,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:51:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 17:51:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 17:51:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 17:51:18,829 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-18 17:51:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:51:19,146 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-18 17:51:19,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 17:51:19,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-18 17:51:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:51:19,147 INFO L225 Difference]: With dead ends: 62 [2018-11-18 17:51:19,148 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 17:51:19,148 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-11-18 17:51:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 17:51:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-18 17:51:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 17:51:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-18 17:51:19,152 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 27 [2018-11-18 17:51:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:51:19,152 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-18 17:51:19,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 17:51:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-18 17:51:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:51:19,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:51:19,153 INFO L375 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] [2018-11-18 17:51:19,153 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:51:19,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:19,154 INFO L82 PathProgramCache]: Analyzing trace with hash 906172561, now seen corresponding path program 1 times [2018-11-18 17:51:19,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:51:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:51:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:19,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:51:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:51:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 17:51:19,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:51:19,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:51:19,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:51:19,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:51:19,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:51:19,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:19,232 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-18 17:51:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:51:19,246 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2018-11-18 17:51:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:51:19,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 17:51:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:51:19,248 INFO L225 Difference]: With dead ends: 68 [2018-11-18 17:51:19,248 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 17:51:19,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:51:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 17:51:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 17:51:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 17:51:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-18 17:51:19,252 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 34 [2018-11-18 17:51:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:51:19,253 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-18 17:51:19,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:51:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-18 17:51:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:51:19,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:51:19,254 INFO L375 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] [2018-11-18 17:51:19,254 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:51:19,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2018-11-18 17:51:19,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:51:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:19,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:51:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:51:19,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:51:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:51:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 17:51:19,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:51:19,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:51:19,389 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-18 17:51:19,389 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [11], [12], [16], [18], [21], [23], [29], [33], [35], [39], [40], [41], [42], [43], [44], [45], [47], [48], [49], [50] [2018-11-18 17:51:19,390 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:51:19,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:51:19,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 17:51:19,408 INFO L272 AbstractInterpreter]: Visited 24 different actions 43 times. Merged at 4 different actions 4 times. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 4. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-18 17:51:19,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:51:19,409 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 17:51:19,431 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 57.14% of their original sizes. [2018-11-18 17:51:19,431 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 17:51:19,512 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-18 17:51:19,512 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 17:51:19,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:51:19,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2018-11-18 17:51:19,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:51:19,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 17:51:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 17:51:19,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:51:19,513 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2018-11-18 17:51:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:51:19,671 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-18 17:51:19,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 17:51:19,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-18 17:51:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:51:19,672 INFO L225 Difference]: With dead ends: 30 [2018-11-18 17:51:19,672 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:51:19,673 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-11-18 17:51:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:51:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:51:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:51:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:51:19,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-18 17:51:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:51:19,674 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:51:19,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 17:51:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:51:19,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:51:19,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:51:19,706 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 17:51:19,706 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:51:19,707 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-18 17:51:19,707 INFO L421 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (not (= id2_~x 0)) [2018-11-18 17:51:19,707 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-18 17:51:19,707 INFO L425 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-18 17:51:19,707 INFO L425 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-11-18 17:51:19,707 INFO L428 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-11-18 17:51:19,715 INFO L425 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-11-18 17:51:19,715 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:51:19,715 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 17:51:19,715 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:51:19,716 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:51:19,716 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2018-11-18 17:51:19,716 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-18 17:51:19,716 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 27) no Hoare annotation was computed. [2018-11-18 17:51:19,716 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-18 17:51:19,716 INFO L428 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-11-18 17:51:19,716 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-18 17:51:19,716 INFO L425 ceAbstractionStarter]: For program point L24-2(lines 21 27) no Hoare annotation was computed. [2018-11-18 17:51:19,717 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-18 17:51:19,717 INFO L425 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-11-18 17:51:19,717 INFO L425 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-11-18 17:51:19,719 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-18 17:51:19,719 INFO L421 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: (not (= id_~x 0)) [2018-11-18 17:51:19,719 INFO L425 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-18 17:51:19,719 INFO L425 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-18 17:51:19,719 INFO L428 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-11-18 17:51:19,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:51:19 BoogieIcfgContainer [2018-11-18 17:51:19,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:51:19,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:51:19,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:51:19,722 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:51:19,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:51:17" (3/4) ... [2018-11-18 17:51:19,725 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:51:19,729 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:51:19,729 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-11-18 17:51:19,730 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:51:19,730 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-11-18 17:51:19,733 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 17:51:19,733 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 17:51:19,733 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 17:51:19,759 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_57e39d7d-201c-4ae8-a937-e3edc44f1377/bin-2019/utaipan/witness.graphml [2018-11-18 17:51:19,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:51:19,760 INFO L168 Benchmark]: Toolchain (without parser) took 2752.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:51:19,760 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:51:19,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:51:19,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.64 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:51:19,761 INFO L168 Benchmark]: Boogie Preprocessor took 11.28 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:51:19,761 INFO L168 Benchmark]: RCFGBuilder took 215.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:51:19,762 INFO L168 Benchmark]: TraceAbstraction took 2310.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.6 MB). Peak memory consumption was 257.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:51:19,762 INFO L168 Benchmark]: Witness Printer took 37.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:51:19,765 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.64 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.28 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 215.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2310.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.6 MB). Peak memory consumption was 257.5 MB. Max. memory is 11.5 GB. * Witness Printer took 37.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 222 SDtfs, 37 SDslu, 1060 SDs, 0 SdLazy, 86 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.7542372881355932 AbsIntWeakeningRatio, 0.6271186440677966 AbsIntAvgWeakeningVarsNumRemoved, 0.3389830508474576 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 15 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 13660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 28/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...