./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/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 3e0675069af96ce2b947856aad4bf6a2d556158b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/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 3e0675069af96ce2b947856aad4bf6a2d556158b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:48,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:48,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:48,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:48,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:48,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:48,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:48,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:48,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:48,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:48,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:48,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:48,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:48,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:48,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:48,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:48,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:48,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:48,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:48,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:48,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:48,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:48,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:48,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:48,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:48,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:48,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:48,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:48,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:48,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:48,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:48,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:48,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:48,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:48,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:48,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:48,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:48,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:48,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:48,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:48,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:48,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:48,481 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:48,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:48,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:48,482 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:48,482 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:48,482 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:48,483 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:48,483 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:48,483 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:48,483 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:48,484 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:48,484 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:48,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:48,485 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:48,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:48,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:48,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:48,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:48,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:48,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:48,486 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:48,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:48,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:48,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:48,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:48,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:48,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:48,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:48,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:48,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:48,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:48,488 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:48,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:48,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:48,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:48,489 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/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/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 -> 3e0675069af96ce2b947856aad4bf6a2d556158b [2019-10-22 11:24:48,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:48,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:48,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:48,527 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:48,528 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:48,528 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2019-10-22 11:24:48,580 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data/ce75680ab/8d0213c628f745168cf22bf74e3480fd/FLAG38615fe5f [2019-10-22 11:24:49,036 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:49,038 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2019-10-22 11:24:49,048 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data/ce75680ab/8d0213c628f745168cf22bf74e3480fd/FLAG38615fe5f [2019-10-22 11:24:49,547 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data/ce75680ab/8d0213c628f745168cf22bf74e3480fd [2019-10-22 11:24:49,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:49,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:49,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:49,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:49,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:49,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:49" (1/1) ... [2019-10-22 11:24:49,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46020af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:49, skipping insertion in model container [2019-10-22 11:24:49,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:49" (1/1) ... [2019-10-22 11:24:49,565 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:49,599 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:49,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:49,971 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:50,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:50,086 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:50,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50 WrapperNode [2019-10-22 11:24:50,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:50,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:50,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:50,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:50,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:50,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:50,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:50,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:50,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:50,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:50,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:50,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:50,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/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-10-22 11:24:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:24:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:24:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:50,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:50,840 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:50,840 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-22 11:24:50,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:50 BoogieIcfgContainer [2019-10-22 11:24:50,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:50,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:50,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:50,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:50,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:49" (1/3) ... [2019-10-22 11:24:50,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f29380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:50, skipping insertion in model container [2019-10-22 11:24:50,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (2/3) ... [2019-10-22 11:24:50,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f29380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:50, skipping insertion in model container [2019-10-22 11:24:50,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:50" (3/3) ... [2019-10-22 11:24:50,851 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-10-22 11:24:50,858 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:50,865 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-22 11:24:50,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-22 11:24:50,889 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:50,889 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:50,890 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:50,890 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:50,890 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:50,890 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:50,890 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:50,890 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 11:24:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:24:50,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,909 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-10-22 11:24:50,922 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747546413] [2019-10-22 11:24:50,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:51,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747546413] [2019-10-22 11:24:51,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:51,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285164341] [2019-10-22 11:24:51,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:24:51,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:24:51,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:51,088 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-22 11:24:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,104 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-10-22 11:24:51,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:24:51,105 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:24:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,113 INFO L225 Difference]: With dead ends: 92 [2019-10-22 11:24:51,114 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:24:51,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:24:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 11:24:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:24:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-22 11:24:51,144 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-10-22 11:24:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,144 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-22 11:24:51,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:24:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-22 11:24:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:24:51,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,145 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-10-22 11:24:51,146 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238345915] [2019-10-22 11:24:51,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:51,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238345915] [2019-10-22 11:24:51,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:51,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925992781] [2019-10-22 11:24:51,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:51,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:51,210 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-10-22 11:24:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,319 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-10-22 11:24:51,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:51,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:24:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,320 INFO L225 Difference]: With dead ends: 47 [2019-10-22 11:24:51,320 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:24:51,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:24:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-22 11:24:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:24:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-22 11:24:51,325 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2019-10-22 11:24:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,326 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-22 11:24:51,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-22 11:24:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:24:51,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,326 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-10-22 11:24:51,327 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878351921] [2019-10-22 11:24:51,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:51,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878351921] [2019-10-22 11:24:51,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:51,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741827816] [2019-10-22 11:24:51,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:51,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:51,396 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-10-22 11:24:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,460 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-22 11:24:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:51,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:24:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,461 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:24:51,461 INFO L226 Difference]: Without dead ends: 37 [2019-10-22 11:24:51,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-22 11:24:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-22 11:24:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:24:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-22 11:24:51,465 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2019-10-22 11:24:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,465 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-22 11:24:51,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-22 11:24:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:24:51,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,466 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,467 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-10-22 11:24:51,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082802259] [2019-10-22 11:24:51,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:51,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082802259] [2019-10-22 11:24:51,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:51,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096900390] [2019-10-22 11:24:51,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:51,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:51,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:51,636 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2019-10-22 11:24:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,886 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-22 11:24:51,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:51,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-10-22 11:24:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,888 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:24:51,888 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 11:24:51,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 11:24:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-10-22 11:24:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:24:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-22 11:24:51,901 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 10 [2019-10-22 11:24:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,901 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-22 11:24:51,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-22 11:24:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:51,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,903 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-10-22 11:24:51,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406546470] [2019-10-22 11:24:51,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406546470] [2019-10-22 11:24:52,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295914295] [2019-10-22 11:24:52,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:52,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:52,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:52,028 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-10-22 11:24:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,118 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-10-22 11:24:52,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:52,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:24:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,122 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:24:52,123 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:24:52,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:24:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 11:24:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:24:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-10-22 11:24:52,129 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 11 [2019-10-22 11:24:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,130 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-10-22 11:24:52,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-10-22 11:24:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:52,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,135 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2019-10-22 11:24:52,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956910002] [2019-10-22 11:24:52,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956910002] [2019-10-22 11:24:52,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205538971] [2019-10-22 11:24:52,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:52,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:52,302 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2019-10-22 11:24:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,379 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-10-22 11:24:52,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:24:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,381 INFO L225 Difference]: With dead ends: 53 [2019-10-22 11:24:52,381 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 11:24:52,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 11:24:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-22 11:24:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:24:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-10-22 11:24:52,388 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 13 [2019-10-22 11:24:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,388 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-10-22 11:24:52,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-10-22 11:24:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:24:52,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,389 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,390 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-10-22 11:24:52,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920954442] [2019-10-22 11:24:52,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920954442] [2019-10-22 11:24:52,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:52,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067948314] [2019-10-22 11:24:52,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,477 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-10-22 11:24:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,600 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-10-22 11:24:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:52,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:24:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,602 INFO L225 Difference]: With dead ends: 66 [2019-10-22 11:24:52,602 INFO L226 Difference]: Without dead ends: 54 [2019-10-22 11:24:52,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-22 11:24:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-22 11:24:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:24:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-10-22 11:24:52,609 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 14 [2019-10-22 11:24:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,609 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-10-22 11:24:52,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-10-22 11:24:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:24:52,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,611 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,611 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-10-22 11:24:52,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609855251] [2019-10-22 11:24:52,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609855251] [2019-10-22 11:24:52,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565954814] [2019-10-22 11:24:52,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/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-10-22 11:24:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 11:24:52,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:52,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:52,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:52,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:52,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-22 11:24:52,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:52,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:52,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:52,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:52,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:52,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-22 11:24:52,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:52,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:52,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:52,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-10-22 11:24:52,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:52,903 INFO L375 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 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-22 11:24:52,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:52,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:52,925 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-22 11:24:52,926 INFO L375 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 24 treesize of output 10 [2019-10-22 11:24:52,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:52,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:52,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:52,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-22 11:24:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,938 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [190479017] [2019-10-22 11:24:52,969 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 18 [2019-10-22 11:24:53,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:24:53,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:24:53,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:53,339 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) 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.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-10-22 11:24:53,351 INFO L168 Benchmark]: Toolchain (without parser) took 3800.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.2 MB in the beginning and 876.4 MB in the end (delta: 62.8 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:53,352 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:53,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:53,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.40 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-10-22 11:24:53,354 INFO L168 Benchmark]: Boogie Preprocessor took 56.59 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-10-22 11:24:53,354 INFO L168 Benchmark]: RCFGBuilder took 640.54 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:53,355 INFO L168 Benchmark]: TraceAbstraction took 2507.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 876.4 MB in the end (delta: 198.0 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:53,357 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 535.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.40 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 56.59 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. * RCFGBuilder took 640.54 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2507.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 876.4 MB in the end (delta: 198.0 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:55,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:55,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:55,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:55,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:55,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:55,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:55,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:55,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:55,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:55,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:55,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:55,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:55,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:55,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:55,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:55,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:55,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:55,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:55,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:55,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:55,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:55,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:55,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:55,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:55,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:55,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:55,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:55,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:55,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:55,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:55,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:55,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:55,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:55,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:55,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:55,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:55,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:55,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:55,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:55,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:55,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:24:55,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:55,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:55,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:55,439 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:55,439 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:55,439 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:55,439 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:55,440 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:55,440 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:55,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:55,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:55,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:55,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:55,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:55,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:55,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:55,441 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:24:55,441 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:24:55,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:55,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:55,442 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:24:55,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:55,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:55,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:55,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:55,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:55,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:55,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:55,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:55,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:55,444 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:24:55,444 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:24:55,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:55,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:55,444 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/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/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 -> 3e0675069af96ce2b947856aad4bf6a2d556158b [2019-10-22 11:24:55,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:55,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:55,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:55,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:55,483 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:55,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2019-10-22 11:24:55,525 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data/c66330f94/9db6765214a146d191242c981891244b/FLAG5471b871f [2019-10-22 11:24:55,963 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:55,967 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2019-10-22 11:24:55,978 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data/c66330f94/9db6765214a146d191242c981891244b/FLAG5471b871f [2019-10-22 11:24:55,989 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/data/c66330f94/9db6765214a146d191242c981891244b [2019-10-22 11:24:55,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:55,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:55,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:55,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:55,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:55,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:55" (1/1) ... [2019-10-22 11:24:56,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b85cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:55, skipping insertion in model container [2019-10-22 11:24:56,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:55" (1/1) ... [2019-10-22 11:24:56,008 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:56,047 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:56,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:56,493 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:56,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:56,603 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:56,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56 WrapperNode [2019-10-22 11:24:56,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:56,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:56,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:56,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:56,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:56,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:56,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:56,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:56,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:56,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:56,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:56,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:56,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/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-10-22 11:24:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:24:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:24:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:57,542 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:57,542 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-22 11:24:57,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:57 BoogieIcfgContainer [2019-10-22 11:24:57,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:57,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:57,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:57,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:57,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:55" (1/3) ... [2019-10-22 11:24:57,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28be57f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:57, skipping insertion in model container [2019-10-22 11:24:57,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56" (2/3) ... [2019-10-22 11:24:57,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28be57f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:57, skipping insertion in model container [2019-10-22 11:24:57,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:57" (3/3) ... [2019-10-22 11:24:57,551 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-10-22 11:24:57,561 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:57,569 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-22 11:24:57,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-22 11:24:57,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:57,597 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:57,597 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:57,597 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:57,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:57,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:57,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:57,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-10-22 11:24:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:24:57,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:57,615 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:24:57,616 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:57,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash 891569350, now seen corresponding path program 1 times [2019-10-22 11:24:57,629 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:57,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [221897453] [2019-10-22 11:24:57,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:57,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:24:57,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:57,738 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:57,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [221897453] [2019-10-22 11:24:57,742 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:57,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:24:57,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16542646] [2019-10-22 11:24:57,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:24:57,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:57,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:24:57,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:57,757 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2019-10-22 11:24:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:57,773 INFO L93 Difference]: Finished difference Result 90 states and 148 transitions. [2019-10-22 11:24:57,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:24:57,774 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:24:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:57,782 INFO L225 Difference]: With dead ends: 90 [2019-10-22 11:24:57,782 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:24:57,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-10-22 11:24:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:24:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 11:24:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:24:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-10-22 11:24:57,822 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 6 [2019-10-22 11:24:57,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:57,823 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-10-22 11:24:57,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:24:57,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-10-22 11:24:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:24:57,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:57,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:24:58,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:58,027 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:58,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:58,027 INFO L82 PathProgramCache]: Analyzing trace with hash 889692517, now seen corresponding path program 1 times [2019-10-22 11:24:58,028 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:58,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [16965492] [2019-10-22 11:24:58,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:58,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:24:58,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:58,173 INFO L375 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 10 treesize of output 8 [2019-10-22 11:24:58,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:58,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:58,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:58,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-22 11:24:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:58,199 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:58,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [16965492] [2019-10-22 11:24:58,203 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:58,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:24:58,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184670824] [2019-10-22 11:24:58,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:58,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:58,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:58,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:58,207 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2019-10-22 11:24:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:58,700 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-10-22 11:24:58,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:58,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:24:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:58,705 INFO L225 Difference]: With dead ends: 45 [2019-10-22 11:24:58,705 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:24:58,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:24:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2019-10-22 11:24:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:24:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-10-22 11:24:58,712 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 6 [2019-10-22 11:24:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:58,712 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-10-22 11:24:58,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-10-22 11:24:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:24:58,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:58,713 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:58,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:58,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1810723981, now seen corresponding path program 1 times [2019-10-22 11:24:58,916 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:58,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [402344956] [2019-10-22 11:24:58,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:59,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:24:59,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:59,065 INFO L375 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 13 treesize of output 9 [2019-10-22 11:24:59,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:59,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:59,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:59,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-10-22 11:24:59,086 INFO L375 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 19 treesize of output 7 [2019-10-22 11:24:59,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:59,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:59,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:59,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-22 11:24:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:59,098 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:59,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [402344956] [2019-10-22 11:24:59,101 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:59,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:24:59,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940424614] [2019-10-22 11:24:59,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:59,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:59,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:59,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:59,104 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2019-10-22 11:24:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:59,467 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-22 11:24:59,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:59,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:24:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:59,472 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:24:59,473 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:24:59,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:24:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:24:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:24:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-10-22 11:24:59,478 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 7 [2019-10-22 11:24:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:59,478 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-10-22 11:24:59,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-10-22 11:24:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:24:59,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:59,479 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:59,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:59,680 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 590587384, now seen corresponding path program 1 times [2019-10-22 11:24:59,681 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:59,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1003318282] [2019-10-22 11:24:59,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:59,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:24:59,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:59,793 INFO L375 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 13 treesize of output 9 [2019-10-22 11:24:59,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:59,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:59,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:59,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-22 11:24:59,837 INFO L375 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-10-22 11:24:59,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:59,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:59,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:59,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-22 11:24:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:59,852 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:59,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1003318282] [2019-10-22 11:24:59,901 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:59,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-10-22 11:24:59,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659876291] [2019-10-22 11:24:59,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:59,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:59,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:59,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:59,902 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 7 states. [2019-10-22 11:25:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:02,141 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-10-22 11:25:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:02,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-10-22 11:25:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:02,143 INFO L225 Difference]: With dead ends: 75 [2019-10-22 11:25:02,143 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:25:02,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:25:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:25:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2019-10-22 11:25:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 11:25:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-10-22 11:25:02,151 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 9 [2019-10-22 11:25:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:02,151 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-10-22 11:25:02,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:25:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-10-22 11:25:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:25:02,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:02,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:02,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:02,353 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:02,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1507179337, now seen corresponding path program 1 times [2019-10-22 11:25:02,354 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:25:02,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1031621611] [2019-10-22 11:25:02,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d2503-c5fb-4ce7-8d9e-5dc16d4aa4c5/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:02,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 11:25:02,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:02,564 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 11:25:02,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-22 11:25:02,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:02,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:02,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:02,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-10-22 11:25:02,694 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-10-22 11:25:02,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 73 [2019-10-22 11:25:02,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:02,756 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.2 percent of original size [2019-10-22 11:25:02,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:02,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:02,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:02,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:02,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:29 [2019-10-22 11:25:03,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:03,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-22 11:25:03,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:04,294 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 52 [2019-10-22 11:25:04,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:04,297 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|], 10=[|v_#memory_$Pointer$.offset_30|]} [2019-10-22 11:25:04,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:04,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:04,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:04,482 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-10-22 11:25:04,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2019-10-22 11:25:04,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:05,113 WARN L191 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-22 11:25:05,114 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.6 percent of original size [2019-10-22 11:25:05,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:05,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:05,309 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-10-22 11:25:05,309 INFO L341 Elim1Store]: treesize reduction 66, result has 55.1 percent of original size [2019-10-22 11:25:05,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 91 [2019-10-22 11:25:05,311 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:05,461 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-22 11:25:05,461 INFO L567 ElimStorePlain]: treesize reduction 56, result has 61.1 percent of original size [2019-10-22 11:25:05,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:05,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:05,473 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:198, output treesize:122 [2019-10-22 11:25:05,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:05,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:05,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:05,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:05,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 85 [2019-10-22 11:25:05,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:05,733 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:05,750 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:05,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 57 [2019-10-22 11:25:05,782 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:05,797 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:05,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 48 [2019-10-22 11:25:05,798 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:06,042 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-22 11:25:06,042 INFO L567 ElimStorePlain]: treesize reduction 27, result has 84.1 percent of original size [2019-10-22 11:25:06,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:06,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2019-10-22 11:25:06,075 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:06,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:06,276 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-10-22 11:25:06,280 INFO L168 Benchmark]: Toolchain (without parser) took 10287.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -228.0 MB). Peak memory consumption was 285.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,280 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:06,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.76 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,281 INFO L168 Benchmark]: Boogie Preprocessor took 39.54 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-10-22 11:25:06,282 INFO L168 Benchmark]: RCFGBuilder took 847.75 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: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,282 INFO L168 Benchmark]: TraceAbstraction took 8734.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.7 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,286 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.76 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.54 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. * RCFGBuilder took 847.75 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: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8734.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.7 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...