./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/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 35d30cdccac93bddd26c3755048a0b29ad39c8fa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/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 35d30cdccac93bddd26c3755048a0b29ad39c8fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:41:53,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:41:53,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:41:53,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:41:53,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:41:53,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:41:53,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:41:53,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:41:53,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:41:53,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:41:53,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:41:53,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:41:53,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:41:53,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:41:53,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:41:53,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:41:53,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:41:53,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:41:53,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:41:53,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:41:53,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:41:53,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:41:53,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:41:53,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:41:53,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:41:53,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:41:53,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:41:53,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:41:53,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:41:53,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:41:53,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:41:53,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:41:53,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:41:53,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:41:53,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:41:53,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:41:53,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:41:53,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:41:53,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:41:53,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:41:53,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:41:53,368 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:41:53,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:41:53,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:41:53,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:41:53,382 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:41:53,382 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:41:53,383 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:41:53,383 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:41:53,383 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:41:53,383 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:41:53,383 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:41:53,383 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:41:53,384 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:41:53,384 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:41:53,384 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:41:53,384 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:41:53,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:41:53,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:41:53,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:41:53,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:41:53,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:41:53,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:41:53,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:41:53,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:41:53,386 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:41:53,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:41:53,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:41:53,387 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:41:53,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:41:53,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:41:53,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:41:53,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:41:53,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:41:53,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:41:53,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:41:53,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:41:53,388 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:41:53,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:41:53,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:41:53,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:41:53,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:41:53,389 INFO L138 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/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/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 -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2019-12-07 10:41:53,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:41:53,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:41:53,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:41:53,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:41:53,510 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:41:53,510 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2019-12-07 10:41:53,549 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data/263b53fea/37a4ea57331c4fbdb612d84d6c712df7/FLAG96cdbd22b [2019-12-07 10:41:53,918 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:41:53,918 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2019-12-07 10:41:53,922 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data/263b53fea/37a4ea57331c4fbdb612d84d6c712df7/FLAG96cdbd22b [2019-12-07 10:41:54,328 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data/263b53fea/37a4ea57331c4fbdb612d84d6c712df7 [2019-12-07 10:41:54,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:41:54,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:41:54,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:41:54,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:41:54,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:41:54,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e7b07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54, skipping insertion in model container [2019-12-07 10:41:54,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:41:54,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:41:54,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:41:54,473 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:41:54,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:41:54,538 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:41:54,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54 WrapperNode [2019-12-07 10:41:54,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:41:54,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:41:54,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:41:54,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:41:54,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:41:54,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:41:54,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:41:54,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:41:54,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... [2019-12-07 10:41:54,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:41:54,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:41:54,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:41:54,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:41:54,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/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 [2019-12-07 10:41:54,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:41:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 10:41:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 10:41:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:41:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:41:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:41:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:41:54,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:41:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:41:54,895 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:41:54,895 INFO L287 CfgBuilder]: Removed 27 assume(true) statements. [2019-12-07 10:41:54,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:41:54 BoogieIcfgContainer [2019-12-07 10:41:54,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:41:54,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:41:54,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:41:54,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:41:54,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:41:54" (1/3) ... [2019-12-07 10:41:54,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bd5757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:41:54, skipping insertion in model container [2019-12-07 10:41:54,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:54" (2/3) ... [2019-12-07 10:41:54,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bd5757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:41:54, skipping insertion in model container [2019-12-07 10:41:54,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:41:54" (3/3) ... [2019-12-07 10:41:54,901 INFO L109 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2019-12-07 10:41:54,907 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:41:54,912 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:41:54,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 10:41:54,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:41:54,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:41:54,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:41:54,933 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:41:54,933 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:41:54,933 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:41:54,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:41:54,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:41:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-12-07 10:41:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:41:54,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:54,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:54,947 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash -436342068, now seen corresponding path program 1 times [2019-12-07 10:41:54,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:41:54,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680037117] [2019-12-07 10:41:54,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:55,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680037117] [2019-12-07 10:41:55,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:55,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:41:55,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037264719] [2019-12-07 10:41:55,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:55,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:41:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:55,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:55,072 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-12-07 10:41:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:55,098 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2019-12-07 10:41:55,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:55,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 10:41:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:55,106 INFO L225 Difference]: With dead ends: 49 [2019-12-07 10:41:55,106 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 10:41:55,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 10:41:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 10:41:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 10:41:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-12-07 10:41:55,130 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2019-12-07 10:41:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:55,130 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-12-07 10:41:55,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2019-12-07 10:41:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:41:55,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:55,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:55,131 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 981906991, now seen corresponding path program 1 times [2019-12-07 10:41:55,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:41:55,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892943877] [2019-12-07 10:41:55,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:41:55,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892943877] [2019-12-07 10:41:55,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:55,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:41:55,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144662760] [2019-12-07 10:41:55,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:55,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:41:55,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:55,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:55,171 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 3 states. [2019-12-07 10:41:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:55,199 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2019-12-07 10:41:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:55,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-12-07 10:41:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:55,200 INFO L225 Difference]: With dead ends: 62 [2019-12-07 10:41:55,200 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 10:41:55,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 10:41:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 26. [2019-12-07 10:41:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 10:41:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-12-07 10:41:55,205 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 12 [2019-12-07 10:41:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:55,205 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-12-07 10:41:55,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-12-07 10:41:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:41:55,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:55,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:55,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:55,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1846102906, now seen corresponding path program 1 times [2019-12-07 10:41:55,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:41:55,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579047734] [2019-12-07 10:41:55,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:55,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579047734] [2019-12-07 10:41:55,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911759200] [2019-12-07 10:41:55,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:41:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:55,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:41:55,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:41:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:55,321 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:41:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:55,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2025595289] [2019-12-07 10:41:55,347 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 10:41:55,347 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:41:55,352 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:41:55,357 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:41:55,358 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:41:56,009 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:41:56,177 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:41:56,185 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:41:56,224 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:41:56,682 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-12-07 10:41:56,823 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-12-07 10:41:56,972 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2019-12-07 10:41:57,224 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-12-07 10:41:57,385 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-12-07 10:41:57,554 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-12-07 10:41:57,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:41:57,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 3, 3] total 15 [2019-12-07 10:41:57,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395490379] [2019-12-07 10:41:57,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:41:57,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:41:57,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:41:57,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:41:57,557 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 13 states. [2019-12-07 10:41:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:57,807 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2019-12-07 10:41:57,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:41:57,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-12-07 10:41:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:57,810 INFO L225 Difference]: With dead ends: 59 [2019-12-07 10:41:57,810 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 10:41:57,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:41:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 10:41:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-12-07 10:41:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 10:41:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-12-07 10:41:57,815 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 14 [2019-12-07 10:41:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:57,815 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-12-07 10:41:57,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:41:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2019-12-07 10:41:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:41:57,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:57,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:58,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:41:58,017 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1810800020, now seen corresponding path program 1 times [2019-12-07 10:41:58,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:41:58,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672750591] [2019-12-07 10:41:58,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:41:58,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672750591] [2019-12-07 10:41:58,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175380104] [2019-12-07 10:41:58,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:41:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:58,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:41:58,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:41:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:41:58,088 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:41:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:41:58,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1812831925] [2019-12-07 10:41:58,095 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 10:41:58,096 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:41:58,096 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:41:58,096 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:41:58,096 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:41:58,580 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:41:58,799 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 10:41:58,952 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-12-07 10:41:59,091 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 10:41:59,215 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-12-07 10:41:59,390 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-12-07 10:41:59,623 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2019-12-07 10:41:59,880 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2019-12-07 10:42:00,108 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2019-12-07 10:42:00,361 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 88 [2019-12-07 10:42:00,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:42:00,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 3, 3] total 15 [2019-12-07 10:42:00,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090424839] [2019-12-07 10:42:00,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:42:00,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:42:00,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:42:00,364 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand 13 states. [2019-12-07 10:42:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:00,626 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2019-12-07 10:42:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:42:00,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-07 10:42:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:00,628 INFO L225 Difference]: With dead ends: 79 [2019-12-07 10:42:00,628 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 10:42:00,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:42:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 10:42:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 31. [2019-12-07 10:42:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 10:42:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-12-07 10:42:00,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 15 [2019-12-07 10:42:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:00,636 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-12-07 10:42:00,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:42:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-12-07 10:42:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:42:00,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:00,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:00,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:00,838 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:00,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:00,839 INFO L82 PathProgramCache]: Analyzing trace with hash 334766310, now seen corresponding path program 1 times [2019-12-07 10:42:00,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:00,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971110596] [2019-12-07 10:42:00,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:42:00,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971110596] [2019-12-07 10:42:00,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626154151] [2019-12-07 10:42:00,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:00,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:42:00,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:42:00,932 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:42:00,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [787855728] [2019-12-07 10:42:00,939 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 10:42:00,939 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:42:00,939 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:42:00,939 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:42:00,939 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:42:01,262 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:42:01,401 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:42:01,612 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 10:42:02,081 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-12-07 10:42:02,318 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-12-07 10:42:02,498 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-12-07 10:42:02,726 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 10:42:02,989 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 10:42:02,991 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:42:02,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:42:02,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2019-12-07 10:42:02,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140327616] [2019-12-07 10:42:02,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:02,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:02,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:02,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:42:02,992 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 5 states. [2019-12-07 10:42:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:03,010 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2019-12-07 10:42:03,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:42:03,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 10:42:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:03,011 INFO L225 Difference]: With dead ends: 60 [2019-12-07 10:42:03,011 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 10:42:03,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:42:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 10:42:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 10:42:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 10:42:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-12-07 10:42:03,019 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 15 [2019-12-07 10:42:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:03,019 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-12-07 10:42:03,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-12-07 10:42:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:42:03,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:03,020 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:03,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:03,221 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:03,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1512670519, now seen corresponding path program 2 times [2019-12-07 10:42:03,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:03,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400027480] [2019-12-07 10:42:03,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:42:03,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400027480] [2019-12-07 10:42:03,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998334937] [2019-12-07 10:42:03,280 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:03,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 10:42:03,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:42:03,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:42:03,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:03,342 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:03,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:42:03,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 11 [2019-12-07 10:42:03,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802844850] [2019-12-07 10:42:03,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:42:03,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:03,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:42:03,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:42:03,372 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 10 states. [2019-12-07 10:42:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:03,549 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2019-12-07 10:42:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:42:03,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-12-07 10:42:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:03,550 INFO L225 Difference]: With dead ends: 107 [2019-12-07 10:42:03,551 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 10:42:03,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:42:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 10:42:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 44. [2019-12-07 10:42:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 10:42:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2019-12-07 10:42:03,559 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 16 [2019-12-07 10:42:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:03,559 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2019-12-07 10:42:03,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:42:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2019-12-07 10:42:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:42:03,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:03,560 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:03,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:03,761 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:03,761 INFO L82 PathProgramCache]: Analyzing trace with hash -6811075, now seen corresponding path program 1 times [2019-12-07 10:42:03,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:03,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110361503] [2019-12-07 10:42:03,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:03,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110361503] [2019-12-07 10:42:03,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323895667] [2019-12-07 10:42:03,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:03,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:42:03,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:03,833 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:03,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1089312222] [2019-12-07 10:42:03,842 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 10:42:03,842 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:42:03,842 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:42:03,843 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:42:03,843 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:42:04,358 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:42:04,603 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-12-07 10:42:04,837 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-12-07 10:42:04,995 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-12-07 10:42:05,144 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-12-07 10:42:05,551 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-12-07 10:42:05,846 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-12-07 10:42:06,154 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-12-07 10:42:06,509 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-12-07 10:42:06,833 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-12-07 10:42:06,834 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:42:06,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:42:06,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2019-12-07 10:42:06,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292046457] [2019-12-07 10:42:06,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:06,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:06,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:42:06,835 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand 5 states. [2019-12-07 10:42:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:06,871 INFO L93 Difference]: Finished difference Result 117 states and 157 transitions. [2019-12-07 10:42:06,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:42:06,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 10:42:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:06,872 INFO L225 Difference]: With dead ends: 117 [2019-12-07 10:42:06,872 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 10:42:06,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:42:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 10:42:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-12-07 10:42:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 10:42:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2019-12-07 10:42:06,880 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 17 [2019-12-07 10:42:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:06,880 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2019-12-07 10:42:06,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2019-12-07 10:42:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:42:06,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:06,880 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:07,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:07,082 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1986937075, now seen corresponding path program 1 times [2019-12-07 10:42:07,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:07,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048274094] [2019-12-07 10:42:07,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:42:07,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048274094] [2019-12-07 10:42:07,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281497601] [2019-12-07 10:42:07,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:07,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 10:42:07,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:42:07,617 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:16,134 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46d64bf7 [2019-12-07 10:42:16,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1081333548] [2019-12-07 10:42:16,135 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 10:42:16,135 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:42:16,135 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:42:16,136 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:42:16,136 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:42:16,141 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46d64bf7 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 10:42:16,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:42:16,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-12-07 10:42:16,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998719893] [2019-12-07 10:42:16,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:42:16,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:16,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:42:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=394, Unknown=5, NotChecked=0, Total=506 [2019-12-07 10:42:16,143 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 12 states. [2019-12-07 10:42:16,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:42:16,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:16,345 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46d64bf7 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 10:42:16,348 INFO L168 Benchmark]: Toolchain (without parser) took 22015.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:16,348 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:42:16,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:16,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.11 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: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:16,350 INFO L168 Benchmark]: Boogie Preprocessor took 20.40 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:16,350 INFO L168 Benchmark]: RCFGBuilder took 305.07 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:16,351 INFO L168 Benchmark]: TraceAbstraction took 21449.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 216.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -93.3 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:16,354 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.11 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: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.40 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 305.07 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21449.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 216.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -93.3 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46d64bf7 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46d64bf7: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 10:42:17,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:42:17,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:42:17,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:42:17,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:42:17,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:42:17,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:42:17,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:42:17,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:42:17,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:42:17,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:42:17,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:42:17,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:42:17,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:42:17,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:42:17,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:42:17,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:42:17,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:42:17,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:42:17,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:42:17,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:42:17,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:42:17,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:42:17,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:42:17,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:42:17,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:42:17,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:42:17,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:42:17,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:42:17,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:42:17,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:42:17,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:42:17,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:42:17,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:42:17,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:42:17,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:42:17,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:42:17,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:42:17,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:42:17,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:42:17,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:42:17,763 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 10:42:17,773 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:42:17,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:42:17,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:42:17,774 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:42:17,774 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:42:17,774 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:42:17,774 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:42:17,775 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:42:17,775 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:42:17,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:42:17,775 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:42:17,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:42:17,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:42:17,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:42:17,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:42:17,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:42:17,776 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:42:17,776 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:42:17,777 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:42:17,777 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:42:17,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:42:17,777 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:42:17,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:42:17,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:42:17,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:42:17,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:42:17,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:42:17,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:42:17,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:42:17,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:42:17,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:42:17,778 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 10:42:17,779 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:42:17,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:42:17,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:42:17,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:42:17,779 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/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 -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2019-12-07 10:42:17,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:42:17,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:42:17,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:42:17,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:42:17,952 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:42:17,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2019-12-07 10:42:17,988 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data/dd84240db/0f7953e0c2084c26a9c28084e3d963c4/FLAGe0e1d4c5a [2019-12-07 10:42:18,440 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:42:18,440 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2019-12-07 10:42:18,444 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data/dd84240db/0f7953e0c2084c26a9c28084e3d963c4/FLAGe0e1d4c5a [2019-12-07 10:42:18,453 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/data/dd84240db/0f7953e0c2084c26a9c28084e3d963c4 [2019-12-07 10:42:18,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:42:18,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:42:18,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:42:18,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:42:18,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:42:18,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc928b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18, skipping insertion in model container [2019-12-07 10:42:18,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:42:18,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:42:18,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:42:18,587 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:42:18,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:42:18,649 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:42:18,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18 WrapperNode [2019-12-07 10:42:18,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:42:18,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:42:18,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:42:18,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:42:18,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:42:18,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:42:18,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:42:18,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:42:18,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... [2019-12-07 10:42:18,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:42:18,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:42:18,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:42:18,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:42:18,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/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 [2019-12-07 10:42:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:42:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 10:42:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-07 10:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 10:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:42:18,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 10:42:19,031 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:42:19,031 INFO L287 CfgBuilder]: Removed 27 assume(true) statements. [2019-12-07 10:42:19,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:19 BoogieIcfgContainer [2019-12-07 10:42:19,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:42:19,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:42:19,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:42:19,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:42:19,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:42:18" (1/3) ... [2019-12-07 10:42:19,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fc165d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:42:19, skipping insertion in model container [2019-12-07 10:42:19,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:18" (2/3) ... [2019-12-07 10:42:19,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fc165d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:42:19, skipping insertion in model container [2019-12-07 10:42:19,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:19" (3/3) ... [2019-12-07 10:42:19,037 INFO L109 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2019-12-07 10:42:19,043 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:42:19,047 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:42:19,054 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 10:42:19,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:42:19,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:42:19,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:42:19,069 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:42:19,069 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:42:19,069 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:42:19,069 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:42:19,069 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:42:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-07 10:42:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:42:19,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:19,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:19,083 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:19,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:19,087 INFO L82 PathProgramCache]: Analyzing trace with hash 409945024, now seen corresponding path program 1 times [2019-12-07 10:42:19,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:42:19,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675961337] [2019-12-07 10:42:19,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 10:42:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:19,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 10:42:19,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:19,173 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:19,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675961337] [2019-12-07 10:42:19,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:19,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:42:19,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332572961] [2019-12-07 10:42:19,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:42:19,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:42:19,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:42:19,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:42:19,195 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-12-07 10:42:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:19,209 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-12-07 10:42:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:42:19,210 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-12-07 10:42:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:19,216 INFO L225 Difference]: With dead ends: 66 [2019-12-07 10:42:19,216 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 10:42:19,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:42:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 10:42:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 10:42:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 10:42:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-12-07 10:42:19,242 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 15 [2019-12-07 10:42:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:19,242 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-12-07 10:42:19,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:42:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-12-07 10:42:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:42:19,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:19,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:19,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:42:19,444 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1581099477, now seen corresponding path program 1 times [2019-12-07 10:42:19,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:42:19,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679578527] [2019-12-07 10:42:19,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 10:42:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:19,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:42:19,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:19,562 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:19,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679578527] [2019-12-07 10:42:19,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:19,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:42:19,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906724956] [2019-12-07 10:42:19,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:19,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:42:19,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:19,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:19,577 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2019-12-07 10:42:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:19,646 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2019-12-07 10:42:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:42:19,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 10:42:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:19,648 INFO L225 Difference]: With dead ends: 61 [2019-12-07 10:42:19,648 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 10:42:19,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 10:42:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 10:42:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 10:42:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-12-07 10:42:19,653 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2019-12-07 10:42:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:19,653 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-12-07 10:42:19,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-12-07 10:42:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:42:19,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:19,654 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:19,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:42:19,856 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:19,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1068182567, now seen corresponding path program 1 times [2019-12-07 10:42:19,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:42:19,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404985435] [2019-12-07 10:42:19,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 10:42:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:19,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:42:19,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:19,973 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:19,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404985435] [2019-12-07 10:42:19,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:19,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:42:19,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696227543] [2019-12-07 10:42:19,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:19,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:42:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:19,982 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 4 states. [2019-12-07 10:42:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:20,107 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2019-12-07 10:42:20,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:42:20,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:42:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:20,109 INFO L225 Difference]: With dead ends: 96 [2019-12-07 10:42:20,109 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 10:42:20,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 10:42:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 42. [2019-12-07 10:42:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 10:42:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-12-07 10:42:20,114 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 19 [2019-12-07 10:42:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:20,115 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-12-07 10:42:20,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-12-07 10:42:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:42:20,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:20,116 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:20,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:42:20,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1994936256, now seen corresponding path program 1 times [2019-12-07 10:42:20,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:42:20,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309632581] [2019-12-07 10:42:20,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 10:42:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:20,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:42:20,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:20,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:42:20,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:20,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:20,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:20,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 10:42:20,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:42:20,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:20,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:20,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:20,494 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 10:42:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:20,503 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:20,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-12-07 10:42:20,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-12-07 10:42:20,540 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:20,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:20,543 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:20,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:20,546 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:20,546 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2019-12-07 10:42:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:20,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309632581] [2019-12-07 10:42:20,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:20,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 10:42:20,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608615820] [2019-12-07 10:42:20,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:42:20,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:42:20,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:42:20,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:42:20,565 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 10 states. [2019-12-07 10:42:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:21,462 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2019-12-07 10:42:21,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:42:21,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 10:42:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:21,465 INFO L225 Difference]: With dead ends: 127 [2019-12-07 10:42:21,465 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 10:42:21,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:42:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 10:42:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 61. [2019-12-07 10:42:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 10:42:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2019-12-07 10:42:21,474 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 21 [2019-12-07 10:42:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:21,474 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2019-12-07 10:42:21,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:42:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2019-12-07 10:42:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:42:21,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:21,476 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:21,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:42:21,677 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:21,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:21,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2064717651, now seen corresponding path program 1 times [2019-12-07 10:42:21,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:42:21,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434268515] [2019-12-07 10:42:21,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 10:42:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:21,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 10:42:21,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:21,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 10:42:21,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:42:21,828 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 10:42:21,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:21,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-12-07 10:42:21,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-12-07 10:42:21,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:21,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:21,896 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:21,896 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2019-12-07 10:42:21,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:42:21,928 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:21,929 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:21,929 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:21,930 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 10:42:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:42:21,944 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:22,004 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_22|]} [2019-12-07 10:42:22,049 INFO L343 Elim1Store]: treesize reduction 36, result has 45.5 percent of original size [2019-12-07 10:42:22,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 30 [2019-12-07 10:42:22,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:42:22,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:22,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:22,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2019-12-07 10:42:22,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:22,083 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 10:42:22,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:22,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 10:42:22,094 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2019-12-07 10:42:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:42:22,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434268515] [2019-12-07 10:42:22,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:22,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 10:42:22,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099674350] [2019-12-07 10:42:22,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:42:22,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:42:22,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:42:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:42:22,201 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand 16 states. [2019-12-07 10:42:23,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:23,335 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2019-12-07 10:42:23,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:42:23,336 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-12-07 10:42:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:23,337 INFO L225 Difference]: With dead ends: 113 [2019-12-07 10:42:23,337 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 10:42:23,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:42:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 10:42:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-12-07 10:42:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 10:42:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-12-07 10:42:23,344 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 24 [2019-12-07 10:42:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:23,344 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-12-07 10:42:23,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:42:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-12-07 10:42:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:42:23,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:23,345 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:23,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:42:23,546 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:23,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:23,547 INFO L82 PathProgramCache]: Analyzing trace with hash -554343156, now seen corresponding path program 1 times [2019-12-07 10:42:23,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:42:23,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895902523] [2019-12-07 10:42:23,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 10:42:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:23,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 10:42:23,655 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:23,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 10:42:23,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:42:23,674 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:42:23,675 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:23,675 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-12-07 10:42:23,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:42:23,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:23,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:23,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:23,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 10:42:23,763 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:42:23,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:23,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:42:23,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-12-07 10:42:23,793 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:23,804 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:23,804 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:23,805 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:22 [2019-12-07 10:42:23,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:23,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-12-07 10:42:23,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:23,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:23,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:23,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:3 [2019-12-07 10:42:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:42:23,854 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:42:23,888 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:42:23,892 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:23,892 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:42:23,892 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2019-12-07 10:42:24,093 INFO L343 Elim1Store]: treesize reduction 25, result has 60.9 percent of original size [2019-12-07 10:42:24,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-12-07 10:42:24,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:24,100 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:24,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 53 [2019-12-07 10:42:24,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:24,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:24,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:24,105 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_13], 2=[v_arrayElimCell_12]} [2019-12-07 10:42:24,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895902523] [2019-12-07 10:42:24,108 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@57c61bfa [2019-12-07 10:42:24,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [412827236] [2019-12-07 10:42:24,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:42:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:24,275 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 10:42:24,276 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@57c61bfa [2019-12-07 10:42:24,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957654426] [2019-12-07 10:42:24,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9848d2de-a729-44cd-ae53-09820505c93a/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:24,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 10:42:24,371 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@57c61bfa [2019-12-07 10:42:24,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:24,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 10:42:24,371 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 10:42:24,371 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:42:24,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:42:24,993 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 10:42:24,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:42:24 BoogieIcfgContainer [2019-12-07 10:42:24,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:42:24,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:42:24,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:42:24,994 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:42:24,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:19" (3/4) ... [2019-12-07 10:42:24,996 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:42:24,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:42:24,997 INFO L168 Benchmark]: Toolchain (without parser) took 6541.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -116.1 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:24,997 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:42:24,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:24,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:42:24,998 INFO L168 Benchmark]: Boogie Preprocessor took 22.42 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:24,999 INFO L168 Benchmark]: RCFGBuilder took 331.74 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:25,000 INFO L168 Benchmark]: TraceAbstraction took 5960.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:25,000 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:42:25,002 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 193.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.42 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 331.74 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5960.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L12] void *pp[2]; [L13] int pstate[2]; [L45] int counter = 1; [L52] int *a; [L53] int *b; [L16] int i; [L17] i=0 [L17] COND TRUE i<2 [L18] pp[i]=0 [L19] pstate[i]=0 [L17] i++ [L17] COND TRUE i<2 [L18] pp[i]=0 [L19] pstate[i]=0 [L17] i++ [L17] COND FALSE !(i<2) [L47] EXPR counter++ [L47] return counter++; [L55] a = malloc(sizeof(int)) [L47] EXPR counter++ [L47] return counter++; [L56] b = malloc(sizeof(int)) [L57] COND FALSE !(a==0 || b==0) [L24] int i; [L25] i=0 [L25] COND TRUE i<2 [L26] EXPR pp[i] [L26] COND TRUE pp[i]==0 [L27] pp[i]=pointer [L28] pstate[i]=1 [L24] int i; [L25] i=0 [L25] COND TRUE i<2 [L26] EXPR pp[i] [L26] COND FALSE !(pp[i]==0) [L25] i++ [L25] COND TRUE i<2 [L26] EXPR pp[i] [L26] COND TRUE pp[i]==0 [L27] pp[i]=pointer [L28] pstate[i]=1 [L35] int i; [L36] i=0 [L36] COND TRUE i<2 [L37] EXPR pp[i] [L37] COND TRUE pp[i]==pointer [L39] EXPR pstate[i] [L39] (pstate[i]==1) ? (0) : __blast_assert () [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 2 error locations. Result: UNKNOWN, OverallTime: 5.9s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 172 SDtfs, 465 SDslu, 436 SDs, 0 SdLazy, 368 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 116 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 14592 SizeOfPredicates, 22 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...