./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:58:11,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:58:11,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:58:11,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:58:11,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:58:11,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:58:11,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:58:11,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:58:11,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:58:11,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:58:11,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:58:11,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:58:11,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:58:11,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:58:11,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:58:12,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:58:12,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:58:12,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:58:12,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:58:12,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:58:12,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:58:12,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:58:12,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:58:12,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:58:12,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:58:12,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:58:12,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:58:12,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:58:12,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:58:12,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:58:12,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:58:12,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:58:12,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:58:12,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:58:12,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:58:12,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:58:12,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:58:12,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:58:12,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:58:12,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:58:12,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:58:12,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:58:12,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:58:12,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:58:12,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:58:12,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:58:12,062 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:58:12,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:58:12,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:58:12,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:58:12,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:58:12,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:58:12,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:58:12,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:58:12,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:58:12,066 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:58:12,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:58:12,067 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:58:12,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:58:12,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:58:12,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:58:12,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:58:12,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:58:12,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:58:12,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:58:12,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:58:12,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:58:12,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:58:12,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:58:12,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:58:12,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 [2019-11-27 23:58:12,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:58:12,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:58:12,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:58:12,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:58:12,387 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:58:12,388 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-27 23:58:12,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa38be967/387b56a990cb4e0d91e610791057b7b7/FLAG9e992def2 [2019-11-27 23:58:13,012 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:58:13,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-27 23:58:13,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa38be967/387b56a990cb4e0d91e610791057b7b7/FLAG9e992def2 [2019-11-27 23:58:13,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa38be967/387b56a990cb4e0d91e610791057b7b7 [2019-11-27 23:58:13,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:58:13,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:58:13,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:58:13,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:58:13,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:58:13,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:13,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb6c85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13, skipping insertion in model container [2019-11-27 23:58:13,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:13,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:58:13,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:58:13,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:58:13,827 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:58:13,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:58:13,934 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:58:13,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13 WrapperNode [2019-11-27 23:58:13,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:58:13,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:58:13,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:58:13,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:58:13,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:13,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:13,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:58:13,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:58:13,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:58:13,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:58:14,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:14,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:14,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:14,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:14,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:14,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:14,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... [2019-11-27 23:58:14,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:58:14,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:58:14,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:58:14,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:58:14,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-27 23:58:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:58:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:58:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:58:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:58:14,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:58:14,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:58:14,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:58:14,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:58:14,542 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:58:14,543 INFO L297 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-27 23:58:14,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:14 BoogieIcfgContainer [2019-11-27 23:58:14,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:58:14,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:58:14,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:58:14,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:58:14,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:58:13" (1/3) ... [2019-11-27 23:58:14,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c60339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:58:14, skipping insertion in model container [2019-11-27 23:58:14,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:13" (2/3) ... [2019-11-27 23:58:14,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c60339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:58:14, skipping insertion in model container [2019-11-27 23:58:14,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:14" (3/3) ... [2019-11-27 23:58:14,553 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2019-11-27 23:58:14,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:58:14,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:58:14,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:58:14,603 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:58:14,603 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:58:14,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:58:14,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:58:14,604 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:58:14,604 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:58:14,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:58:14,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:58:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-27 23:58:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:58:14,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:14,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:14,625 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:14,630 INFO L82 PathProgramCache]: Analyzing trace with hash 742134712, now seen corresponding path program 1 times [2019-11-27 23:58:14,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:14,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091730809] [2019-11-27 23:58:14,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:14,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091730809] [2019-11-27 23:58:14,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:58:14,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:58:14,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798203746] [2019-11-27 23:58:14,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:58:14,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:58:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:58:14,829 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-27 23:58:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:14,881 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2019-11-27 23:58:14,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:58:14,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 23:58:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:14,896 INFO L225 Difference]: With dead ends: 43 [2019-11-27 23:58:14,897 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 23:58:14,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:58:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 23:58:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-27 23:58:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-27 23:58:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-27 23:58:14,951 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2019-11-27 23:58:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:14,952 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-27 23:58:14,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:58:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-27 23:58:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 23:58:14,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:14,953 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:14,953 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash -60440637, now seen corresponding path program 1 times [2019-11-27 23:58:14,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:14,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336575048] [2019-11-27 23:58:14,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:15,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336575048] [2019-11-27 23:58:15,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525725746] [2019-11-27 23:58:15,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-27 23:58:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:15,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:58:15,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:15,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:15,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-27 23:58:15,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247443993] [2019-11-27 23:58:15,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:58:15,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:15,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:58:15,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:58:15,171 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-11-27 23:58:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:15,284 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-27 23:58:15,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:58:15,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-27 23:58:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:15,286 INFO L225 Difference]: With dead ends: 35 [2019-11-27 23:58:15,286 INFO L226 Difference]: Without dead ends: 24 [2019-11-27 23:58:15,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:58:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-27 23:58:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-27 23:58:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 23:58:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-27 23:58:15,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 13 [2019-11-27 23:58:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:15,293 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-27 23:58:15,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:58:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-27 23:58:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:58:15,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:15,298 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:15,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:15,500 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:15,501 INFO L82 PathProgramCache]: Analyzing trace with hash 500274136, now seen corresponding path program 2 times [2019-11-27 23:58:15,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:15,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946637444] [2019-11-27 23:58:15,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:15,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946637444] [2019-11-27 23:58:15,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614322172] [2019-11-27 23:58:15,658 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:15,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:58:15,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:15,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 23:58:15,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:15,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:15,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-27 23:58:15,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829215097] [2019-11-27 23:58:15,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:58:15,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:15,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:58:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:58:15,788 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-11-27 23:58:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:15,818 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-11-27 23:58:15,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:58:15,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-27 23:58:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:15,820 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:58:15,820 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:58:15,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:58:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:58:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-27 23:58:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 23:58:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-27 23:58:15,826 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-11-27 23:58:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:15,827 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-27 23:58:15,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:58:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-27 23:58:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:58:15,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:15,828 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:16,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:16,032 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:16,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1626262435, now seen corresponding path program 3 times [2019-11-27 23:58:16,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:16,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917280990] [2019-11-27 23:58:16,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:16,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917280990] [2019-11-27 23:58:16,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406006612] [2019-11-27 23:58:16,132 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:16,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 23:58:16,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:16,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-27 23:58:16,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:16,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:58:16,314 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:16,326 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:16,327 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:16,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-27 23:58:16,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-27 23:58:16,356 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:16,364 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:16,364 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:16,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2019-11-27 23:58:16,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 23:58:16,418 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:16,423 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:16,423 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:16,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-27 23:58:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-27 23:58:16,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:16,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-11-27 23:58:16,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542219822] [2019-11-27 23:58:16,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:58:16,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:16,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:58:16,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:58:16,448 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2019-11-27 23:58:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:16,861 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-11-27 23:58:16,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 23:58:16,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-27 23:58:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:16,863 INFO L225 Difference]: With dead ends: 41 [2019-11-27 23:58:16,863 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 23:58:16,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:58:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 23:58:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-27 23:58:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:58:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-27 23:58:16,872 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2019-11-27 23:58:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:16,873 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-27 23:58:16,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:58:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-27 23:58:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:58:16,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:16,874 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:17,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:17,090 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1335739081, now seen corresponding path program 1 times [2019-11-27 23:58:17,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:17,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161072458] [2019-11-27 23:58:17,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-27 23:58:17,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161072458] [2019-11-27 23:58:17,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414338440] [2019-11-27 23:58:17,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:18,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-27 23:58:18,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:18,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:58:18,097 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,133 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,133 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-27 23:58:18,213 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|], 2=[|v_#memory_int_19|, |v_#memory_int_18|]} [2019-11-27 23:58:18,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:18,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-27 23:58:18,229 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,263 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:18,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-27 23:58:18,272 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,293 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-27 23:58:18,304 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,327 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:58:18,353 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-27 23:58:18,355 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,384 INFO L588 ElimStorePlain]: treesize reduction 16, result has 71.4 percent of original size [2019-11-27 23:58:18,385 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,386 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:89, output treesize:37 [2019-11-27 23:58:18,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2019-11-27 23:58:18,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:18,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:18,457 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:18,518 INFO L588 ElimStorePlain]: treesize reduction 12, result has 85.7 percent of original size [2019-11-27 23:58:18,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-27 23:58:18,547 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,601 INFO L588 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size [2019-11-27 23:58:18,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-27 23:58:18,614 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,651 INFO L588 ElimStorePlain]: treesize reduction 12, result has 81.5 percent of original size [2019-11-27 23:58:18,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:18,654 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:18,654 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:53 [2019-11-27 23:58:18,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:18,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:18,819 INFO L404 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 5=[|v_#memory_$Pointer$.base_14|, |v_#memory_$Pointer$.offset_14|, |v_#memory_int_21|]} [2019-11-27 23:58:18,826 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:18,854 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,857 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:18,881 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,891 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-11-27 23:58:18,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:18,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:18,897 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:58:18,898 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_9], 1=[v_arrayElimCell_10]} [2019-11-27 23:58:19,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:19,102 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 23:58:19,107 INFO L168 Benchmark]: Toolchain (without parser) took 5835.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -114.1 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,108 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:19,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,110 INFO L168 Benchmark]: Boogie Preprocessor took 36.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:19,110 INFO L168 Benchmark]: RCFGBuilder took 517.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,111 INFO L168 Benchmark]: TraceAbstraction took 4560.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -21.0 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,119 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 660.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 517.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4560.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -21.0 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:58:20,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:58:20,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:58:20,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:58:20,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:58:20,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:58:20,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:58:20,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:58:20,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:58:20,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:58:20,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:58:20,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:58:20,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:58:20,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:58:20,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:58:20,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:58:20,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:58:20,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:58:20,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:58:21,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:58:21,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:58:21,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:58:21,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:58:21,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:58:21,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:58:21,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:58:21,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:58:21,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:58:21,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:58:21,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:58:21,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:58:21,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:58:21,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:58:21,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:58:21,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:58:21,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:58:21,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:58:21,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:58:21,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:58:21,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:58:21,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:58:21,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 23:58:21,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:58:21,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:58:21,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:58:21,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:58:21,051 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:58:21,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:58:21,051 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:58:21,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:58:21,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:58:21,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:58:21,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:58:21,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:58:21,053 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:58:21,053 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:58:21,053 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:58:21,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:58:21,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:58:21,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:58:21,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:58:21,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:58:21,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:58:21,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:58:21,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:58:21,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:58:21,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:58:21,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:58:21,057 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:58:21,057 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:58:21,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:58:21,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:58:21,058 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 [2019-11-27 23:58:21,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:58:21,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:58:21,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:58:21,368 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:58:21,369 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:58:21,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-27 23:58:21,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382b7a038/ed54110b0cb34f788beb1a6726d5df69/FLAG1ccd7f772 [2019-11-27 23:58:21,904 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:58:21,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-27 23:58:21,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382b7a038/ed54110b0cb34f788beb1a6726d5df69/FLAG1ccd7f772 [2019-11-27 23:58:22,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382b7a038/ed54110b0cb34f788beb1a6726d5df69 [2019-11-27 23:58:22,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:58:22,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:58:22,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:58:22,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:58:22,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:58:22,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5169a7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22, skipping insertion in model container [2019-11-27 23:58:22,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:58:22,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:58:22,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:58:22,713 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:58:22,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:58:22,812 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:58:22,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22 WrapperNode [2019-11-27 23:58:22,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:58:22,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:58:22,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:58:22,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:58:22,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:58:22,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:58:22,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:58:22,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:58:22,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... [2019-11-27 23:58:22,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:58:22,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:58:22,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:58:22,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:58:22,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-27 23:58:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:58:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:58:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:58:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:58:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:58:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 23:58:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:58:23,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:58:23,530 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:58:23,530 INFO L297 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-27 23:58:23,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:23 BoogieIcfgContainer [2019-11-27 23:58:23,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:58:23,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:58:23,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:58:23,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:58:23,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:58:22" (1/3) ... [2019-11-27 23:58:23,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cda678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:58:23, skipping insertion in model container [2019-11-27 23:58:23,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:22" (2/3) ... [2019-11-27 23:58:23,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cda678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:58:23, skipping insertion in model container [2019-11-27 23:58:23,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:23" (3/3) ... [2019-11-27 23:58:23,540 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2019-11-27 23:58:23,550 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:58:23,559 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:58:23,573 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:58:23,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:58:23,600 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:58:23,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:58:23,600 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:58:23,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:58:23,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:58:23,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:58:23,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:58:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-27 23:58:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:58:23,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:23,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:23,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 742134712, now seen corresponding path program 1 times [2019-11-27 23:58:23,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:58:23,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117293847] [2019-11-27 23:58:23,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 23:58:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:23,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 23:58:23,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:23,820 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:58:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:23,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117293847] [2019-11-27 23:58:23,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:58:23,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 23:58:23,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819419459] [2019-11-27 23:58:23,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:58:23,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:58:23,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:58:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:58:23,866 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-11-27 23:58:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:23,951 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2019-11-27 23:58:23,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:58:23,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-27 23:58:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:23,964 INFO L225 Difference]: With dead ends: 44 [2019-11-27 23:58:23,965 INFO L226 Difference]: Without dead ends: 22 [2019-11-27 23:58:23,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:58:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-27 23:58:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-27 23:58:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 23:58:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-27 23:58:24,007 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2019-11-27 23:58:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:24,008 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-27 23:58:24,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:58:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-27 23:58:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:58:24,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:24,009 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:24,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:58:24,232 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash 500274136, now seen corresponding path program 1 times [2019-11-27 23:58:24,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:58:24,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246222115] [2019-11-27 23:58:24,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 23:58:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:24,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 23:58:24,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:24,367 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:58:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:24,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246222115] [2019-11-27 23:58:24,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:24,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-27 23:58:24,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672778481] [2019-11-27 23:58:24,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:58:24,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:58:24,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:58:24,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:58:24,427 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-11-27 23:58:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:24,584 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-11-27 23:58:24,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:58:24,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-27 23:58:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:24,586 INFO L225 Difference]: With dead ends: 39 [2019-11-27 23:58:24,586 INFO L226 Difference]: Without dead ends: 28 [2019-11-27 23:58:24,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:58:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-27 23:58:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-27 23:58:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:58:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-27 23:58:24,594 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2019-11-27 23:58:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:24,594 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-27 23:58:24,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:58:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-27 23:58:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:58:24,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:24,596 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:24,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:58:24,814 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:24,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2045871112, now seen corresponding path program 2 times [2019-11-27 23:58:24,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:58:24,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131366269] [2019-11-27 23:58:24,818 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 23:58:25,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:58:25,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:25,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-27 23:58:25,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:25,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:58:25,169 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:25,182 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:25,183 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:25,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-27 23:58:25,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:25,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-27 23:58:25,228 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:25,239 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:25,239 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:25,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-27 23:58:25,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 23:58:25,295 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:25,304 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:25,304 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:25,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-27 23:58:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-27 23:58:25,328 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:58:25,409 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:25,414 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:25,415 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:25,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-27 23:58:25,476 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:25,519 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:25,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:25,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:25,527 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-27 23:58:25,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2019-11-27 23:58:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-27 23:58:25,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131366269] [2019-11-27 23:58:25,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:25,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-27 23:58:25,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916729623] [2019-11-27 23:58:25,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:58:25,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:58:25,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:58:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:58:25,644 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 14 states. [2019-11-27 23:58:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:26,276 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-11-27 23:58:26,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:58:26,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-27 23:58:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:26,279 INFO L225 Difference]: With dead ends: 32 [2019-11-27 23:58:26,280 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 23:58:26,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:58:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 23:58:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-27 23:58:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:58:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-27 23:58:26,296 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-11-27 23:58:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:26,298 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-27 23:58:26,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:58:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-27 23:58:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:58:26,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:26,302 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:26,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:58:26,515 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1335739081, now seen corresponding path program 1 times [2019-11-27 23:58:26,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:58:26,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31366535] [2019-11-27 23:58:26,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 23:58:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:26,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-27 23:58:26,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:26,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:58:26,881 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:26,889 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:26,890 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:26,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:58:26,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:26,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-27 23:58:26,932 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:26,979 INFO L588 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-27 23:58:26,981 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:26,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-27 23:58:27,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 71 [2019-11-27 23:58:27,061 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,126 INFO L588 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-11-27 23:58:27,128 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:27,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:34 [2019-11-27 23:58:27,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 103 [2019-11-27 23:58:27,293 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,423 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-27 23:58:27,424 INFO L588 ElimStorePlain]: treesize reduction 42, result has 56.3 percent of original size [2019-11-27 23:58:27,427 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:27,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:54 [2019-11-27 23:58:27,499 INFO L377 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 13 treesize of output 9 [2019-11-27 23:58:27,499 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,550 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,553 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:27,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2019-11-27 23:58:27,687 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 54 [2019-11-27 23:58:27,690 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,766 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,767 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:34 [2019-11-27 23:58:27,838 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_24|], 2=[|v_#memory_int_30|, |v_#memory_int_31|]} [2019-11-27 23:58:27,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:27,860 INFO L377 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 22 treesize of output 7 [2019-11-27 23:58:27,860 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,983 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-27 23:58:27,983 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:27,999 INFO L377 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 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-27 23:58:27,999 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:28,062 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,069 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:28,110 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:28,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-27 23:58:28,124 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:28,175 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,176 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:28,176 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:54 [2019-11-27 23:58:28,250 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_25|], 4=[|v_#memory_int_32|]} [2019-11-27 23:58:28,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-27 23:58:28,265 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:28,338 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-11-27 23:58:28,347 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:28,438 INFO L588 ElimStorePlain]: treesize reduction 4, result has 95.0 percent of original size [2019-11-27 23:58:28,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:28,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2019-11-27 23:58:28,454 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:28,480 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,481 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:28,481 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:88, output treesize:61 [2019-11-27 23:58:28,631 INFO L404 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 1=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_26|], 3=[|v_#memory_int_33|]} [2019-11-27 23:58:28,642 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:28,704 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,710 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:28,749 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:28,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2019-11-27 23:58:28,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:58:28,789 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:28,791 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,791 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:28,818 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,839 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:28,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 69 [2019-11-27 23:58:28,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:28,851 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_25], 1=[v_arrayElimCell_26]} [2019-11-27 23:58:29,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:58:29,056 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 23:58:29,061 INFO L168 Benchmark]: Toolchain (without parser) took 6783.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:29,062 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:29,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:29,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.50 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:29,064 INFO L168 Benchmark]: Boogie Preprocessor took 72.96 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-11-27 23:58:29,064 INFO L168 Benchmark]: RCFGBuilder took 579.56 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:29,068 INFO L168 Benchmark]: TraceAbstraction took 5527.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.6 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:29,076 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.50 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.96 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 579.56 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5527.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.6 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...