./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.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/heap-data/cart.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 e1105d102f382446f080488a8ecb609878e241e6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/heap-data/cart.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 e1105d102f382446f080488a8ecb609878e241e6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:57:46,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:57:46,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:57:46,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:57:46,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:57:46,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:57:46,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:57:46,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:57:46,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:57:46,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:57:46,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:57:46,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:57:46,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:57:46,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:57:46,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:57:46,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:57:46,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:57:46,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:57:46,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:57:46,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:57:46,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:57:46,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:57:46,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:57:46,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:57:46,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:57:46,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:57:46,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:57:46,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:57:46,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:57:46,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:57:46,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:57:46,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:57:46,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:57:46,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:57:46,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:57:46,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:57:46,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:57:46,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:57:46,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:57:46,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:57:46,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:57:46,863 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:57:46,883 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:57:46,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:57:46,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:57:46,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:57:46,886 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:57:46,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:57:46,886 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:57:46,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:57:46,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:57:46,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:57:46,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:57:46,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:57:46,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:57:46,889 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:57:46,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:57:46,890 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:57:46,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:57:46,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:57:46,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:57:46,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:57:46,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:57:46,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:57:46,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:57:46,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:57:46,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:57:46,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:57:46,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:57:46,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:57:46,893 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 -> e1105d102f382446f080488a8ecb609878e241e6 [2019-11-27 23:57:47,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:57:47,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:57:47,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:57:47,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:57:47,255 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:57:47,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2019-11-27 23:57:47,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215954518/d4939a5755b740349af0cc8950645716/FLAG77efdfd31 [2019-11-27 23:57:47,849 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:57:47,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2019-11-27 23:57:47,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215954518/d4939a5755b740349af0cc8950645716/FLAG77efdfd31 [2019-11-27 23:57:48,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215954518/d4939a5755b740349af0cc8950645716 [2019-11-27 23:57:48,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:57:48,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:57:48,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:57:48,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:57:48,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:57:48,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f74f45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48, skipping insertion in model container [2019-11-27 23:57:48,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:57:48,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:57:48,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:57:48,642 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:57:48,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:57:48,764 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:57:48,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48 WrapperNode [2019-11-27 23:57:48,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:57:48,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:57:48,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:57:48,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:57:48,775 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:57:48" (1/1) ... [2019-11-27 23:57:48,793 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:57:48" (1/1) ... [2019-11-27 23:57:48,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:57:48,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:57:48,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:57:48,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:57:48,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (1/1) ... [2019-11-27 23:57:48,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:57:48,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:57:48,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:57:48,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:57:48,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (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:57:48,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:57:48,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:57:48,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:57:48,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:57:48,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:57:48,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:57:48,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:57:49,285 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:57:49,285 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 23:57:49,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:57:49 BoogieIcfgContainer [2019-11-27 23:57:49,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:57:49,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:57:49,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:57:49,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:57:49,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:57:48" (1/3) ... [2019-11-27 23:57:49,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382e2ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:57:49, skipping insertion in model container [2019-11-27 23:57:49,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:48" (2/3) ... [2019-11-27 23:57:49,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382e2ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:57:49, skipping insertion in model container [2019-11-27 23:57:49,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:57:49" (3/3) ... [2019-11-27 23:57:49,295 INFO L109 eAbstractionObserver]: Analyzing ICFG cart.i [2019-11-27 23:57:49,305 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:57:49,312 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:57:49,320 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:57:49,340 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:57:49,340 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:57:49,340 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:57:49,341 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:57:49,341 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:57:49,341 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:57:49,341 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:57:49,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:57:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-27 23:57:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 23:57:49,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:49,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:49,361 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2019-11-27 23:57:49,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:57:49,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156392251] [2019-11-27 23:57:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:57:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:49,480 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:57:49,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156392251] [2019-11-27 23:57:49,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:57:49,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:57:49,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767245483] [2019-11-27 23:57:49,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:57:49,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:57:49,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:57:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:57:49,500 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-27 23:57:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:49,515 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-11-27 23:57:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:57:49,516 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-27 23:57:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:49,524 INFO L225 Difference]: With dead ends: 34 [2019-11-27 23:57:49,524 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 23:57:49,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:57:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 23:57:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-27 23:57:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-27 23:57:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-27 23:57:49,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2019-11-27 23:57:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:49,559 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-27 23:57:49,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:57:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-11-27 23:57:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 23:57:49,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:49,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:49,561 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2019-11-27 23:57:49,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:57:49,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250812089] [2019-11-27 23:57:49,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:57:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:49,665 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:57:49,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250812089] [2019-11-27 23:57:49,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:57:49,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:57:49,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308143045] [2019-11-27 23:57:49,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:57:49,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:57:49,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:57:49,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:57:49,669 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2019-11-27 23:57:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:49,774 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2019-11-27 23:57:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:57:49,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-27 23:57:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:49,776 INFO L225 Difference]: With dead ends: 36 [2019-11-27 23:57:49,776 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 23:57:49,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:57:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 23:57:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-27 23:57:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 23:57:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-27 23:57:49,785 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2019-11-27 23:57:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:49,785 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-27 23:57:49,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:57:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-11-27 23:57:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:57:49,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:49,786 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:49,787 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2019-11-27 23:57:49,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:57:49,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443982067] [2019-11-27 23:57:49,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:57:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:57:49,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443982067] [2019-11-27 23:57:49,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:57:49,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:57:49,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045542554] [2019-11-27 23:57:49,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:57:49,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:57:49,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:57:49,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:57:49,877 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2019-11-27 23:57:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:49,938 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-11-27 23:57:49,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:57:49,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-27 23:57:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:49,940 INFO L225 Difference]: With dead ends: 36 [2019-11-27 23:57:49,940 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 23:57:49,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:57:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 23:57:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-11-27 23:57:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 23:57:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-27 23:57:49,948 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2019-11-27 23:57:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:49,949 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-27 23:57:49,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:57:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-27 23:57:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:57:49,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:49,950 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:49,951 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:49,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2019-11-27 23:57:49,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:57:49,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496212902] [2019-11-27 23:57:49,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:57:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 23:57:50,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496212902] [2019-11-27 23:57:50,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:57:50,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:57:50,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632045444] [2019-11-27 23:57:50,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:57:50,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:57:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:57:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:57:50,048 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 3 states. [2019-11-27 23:57:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:50,064 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-27 23:57:50,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:57:50,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 23:57:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:50,066 INFO L225 Difference]: With dead ends: 37 [2019-11-27 23:57:50,066 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:57:50,067 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:57:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:57:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-27 23:57:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:57:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-27 23:57:50,076 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-11-27 23:57:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:50,076 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-27 23:57:50,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:57:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-27 23:57:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:57:50,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:50,079 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:50,080 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:50,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2019-11-27 23:57:50,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:57:50,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075319542] [2019-11-27 23:57:50,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:57:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:57:50,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075319542] [2019-11-27 23:57:50,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395002319] [2019-11-27 23:57:50,439 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:57:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:50,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-27 23:57:50,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:57:50,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:57:50,696 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 0 case distinctions, treesize of input 29 treesize of output 22 [2019-11-27 23:57:50,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 18 [2019-11-27 23:57:50,706 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:50,714 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:50,715 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:50,723 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:50,724 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:57:50,724 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2019-11-27 23:57:50,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:50,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-11-27 23:57:50,751 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:50,754 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:50,754 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:57:50,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-11-27 23:57:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:57:50,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:57:50,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-27 23:57:50,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734507669] [2019-11-27 23:57:50,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:57:50,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:57:50,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:57:50,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:57:50,762 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 10 states. [2019-11-27 23:57:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:51,065 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-11-27 23:57:51,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:57:51,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-27 23:57:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:51,067 INFO L225 Difference]: With dead ends: 48 [2019-11-27 23:57:51,067 INFO L226 Difference]: Without dead ends: 46 [2019-11-27 23:57:51,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:57:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-27 23:57:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2019-11-27 23:57:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-27 23:57:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-11-27 23:57:51,075 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2019-11-27 23:57:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:51,075 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-11-27 23:57:51,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:57:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-11-27 23:57:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:57:51,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:51,077 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:51,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:57:51,278 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2019-11-27 23:57:51,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:57:51,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228510690] [2019-11-27 23:57:51,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:57:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 23:57:51,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228510690] [2019-11-27 23:57:51,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895299607] [2019-11-27 23:57:51,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:57:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:51,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 23:57:51,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:57:51,489 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 19 treesize of output 1 [2019-11-27 23:57:51,490 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:51,499 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:51,500 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:51,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-27 23:57:51,510 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:57:51,511 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:51,518 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:51,521 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:57:51,522 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:51,534 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:51,535 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:51,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-27 23:57:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 23:57:51,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:57:51,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-27 23:57:51,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294351005] [2019-11-27 23:57:51,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:57:51,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:57:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:57:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:57:51,540 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 7 states. [2019-11-27 23:57:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:51,726 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2019-11-27 23:57:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:57:51,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-27 23:57:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:51,728 INFO L225 Difference]: With dead ends: 52 [2019-11-27 23:57:51,728 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 23:57:51,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:57:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 23:57:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-27 23:57:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 23:57:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-27 23:57:51,735 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 23 [2019-11-27 23:57:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:51,736 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-27 23:57:51,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:57:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-27 23:57:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:57:51,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:51,737 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:51,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:57:51,941 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2019-11-27 23:57:51,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:57:51,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131102777] [2019-11-27 23:57:51,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:57:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:57:52,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131102777] [2019-11-27 23:57:52,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477363832] [2019-11-27 23:57:52,126 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 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:57:52,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:57:52,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:57:52,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-27 23:57:52,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:57:52,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:57:52,203 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,208 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:52,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:57:52,212 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,216 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:52,216 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-27 23:57:52,263 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:57:52,293 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:52,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:52,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:52,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:52,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-11-27 23:57:52,308 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,335 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:52,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:52,343 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 27 treesize of output 11 [2019-11-27 23:57:52,344 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,360 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:52,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:52,367 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 24 treesize of output 10 [2019-11-27 23:57:52,368 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,382 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:52,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:52,389 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 27 treesize of output 11 [2019-11-27 23:57:52,390 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,404 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:52,407 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:57:52,408 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,412 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:52,412 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:52,413 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:105, output treesize:7 [2019-11-27 23:57:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:57:52,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:57:52,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-27 23:57:52,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631223241] [2019-11-27 23:57:52,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:57:52,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:57:52,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:57:52,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:57:52,417 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 8 states. [2019-11-27 23:57:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:52,587 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2019-11-27 23:57:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:57:52,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-27 23:57:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:52,589 INFO L225 Difference]: With dead ends: 59 [2019-11-27 23:57:52,589 INFO L226 Difference]: Without dead ends: 36 [2019-11-27 23:57:52,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:57:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-27 23:57:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-27 23:57:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-27 23:57:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-11-27 23:57:52,603 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 24 [2019-11-27 23:57:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:52,604 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-27 23:57:52,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:57:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2019-11-27 23:57:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 23:57:52,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:52,609 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:52,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:57:52,821 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:52,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:52,822 INFO L82 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2019-11-27 23:57:52,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:57:52,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459887158] [2019-11-27 23:57:52,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:57:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:57:53,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459887158] [2019-11-27 23:57:53,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714902191] [2019-11-27 23:57:53,134 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 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:57:53,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 23:57:53,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:57:53,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-27 23:57:53,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:57:53,239 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:57:53,240 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,247 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,247 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:57:53,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-27 23:57:53,265 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,271 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:57:53,274 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,279 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,280 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:8 [2019-11-27 23:57:53,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:57:53,368 INFO L404 ElimStorePlain]: Different costs {1=[|v_#memory_int_11|], 2=[|v_#memory_$Pointer$.base_17|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_16|]} [2019-11-27 23:57:53,377 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 0 case distinctions, treesize of input 39 treesize of output 32 [2019-11-27 23:57:53,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:53,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:53,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:53,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 22 [2019-11-27 23:57:53,392 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,398 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,399 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,418 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:53,425 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 28 treesize of output 12 [2019-11-27 23:57:53,426 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,440 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,442 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:57:53,460 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,467 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 21 treesize of output 17 [2019-11-27 23:57:53,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:53,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:57:53,477 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 12 treesize of output 8 [2019-11-27 23:57:53,478 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,480 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,480 INFO L508 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:57:53,486 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:57:53,486 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:57:53,487 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:92, output treesize:20 [2019-11-27 23:57:53,517 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 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-27 23:57:53,538 INFO L343 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2019-11-27 23:57:53,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2019-11-27 23:57:53,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:57:53,544 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimArr_2], 1=[v_arrayElimArr_1]} [2019-11-27 23:57:53,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:57:53,748 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.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:57:53,753 INFO L168 Benchmark]: Toolchain (without parser) took 5619.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:57:53,754 INFO L168 Benchmark]: CDTParser took 0.50 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:57:53,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:57:53,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:57:53,755 INFO L168 Benchmark]: Boogie Preprocessor took 38.12 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:57:53,757 INFO L168 Benchmark]: RCFGBuilder took 428.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:57:53,757 INFO L168 Benchmark]: TraceAbstraction took 4463.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:57:53,760 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.50 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 629.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.12 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 428.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4463.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.9 MB). Peak memory consumption was 48.9 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:57:55,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:57:55,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:57:55,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:57:55,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:57:55,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:57:55,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:57:55,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:57:55,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:57:55,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:57:55,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:57:55,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:57:55,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:57:55,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:57:55,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:57:55,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:57:55,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:57:55,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:57:55,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:57:55,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:57:55,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:57:55,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:57:55,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:57:55,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:57:55,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:57:55,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:57:55,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:57:55,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:57:55,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:57:55,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:57:55,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:57:55,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:57:55,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:57:55,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:57:55,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:57:55,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:57:55,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:57:55,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:57:55,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:57:55,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:57:55,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:57:55,687 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:57:55,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:57:55,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:57:55,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:57:55,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:57:55,708 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:57:55,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:57:55,709 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:57:55,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:57:55,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:57:55,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:57:55,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:57:55,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:57:55,711 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:57:55,712 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:57:55,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:57:55,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:57:55,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:57:55,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:57:55,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:57:55,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:57:55,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:57:55,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:57:55,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:57:55,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:57:55,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:57:55,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:57:55,715 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:57:55,716 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:57:55,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:57:55,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:57:55,716 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 -> e1105d102f382446f080488a8ecb609878e241e6 [2019-11-27 23:57:56,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:57:56,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:57:56,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:57:56,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:57:56,038 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:57:56,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2019-11-27 23:57:56,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5197b869b/eb3bbcdc713e4284bbf7318346c02156/FLAG15caf677d [2019-11-27 23:57:56,616 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:57:56,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2019-11-27 23:57:56,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5197b869b/eb3bbcdc713e4284bbf7318346c02156/FLAG15caf677d [2019-11-27 23:57:56,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5197b869b/eb3bbcdc713e4284bbf7318346c02156 [2019-11-27 23:57:56,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:57:56,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:57:56,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:57:56,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:57:56,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:57:56,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:57:56" (1/1) ... [2019-11-27 23:57:56,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4ecbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:56, skipping insertion in model container [2019-11-27 23:57:56,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:57:56" (1/1) ... [2019-11-27 23:57:56,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:57:56,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:57:57,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:57:57,374 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:57:57,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:57:57,501 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:57:57,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57 WrapperNode [2019-11-27 23:57:57,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:57:57,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:57:57,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:57:57,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:57:57,511 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:57:57" (1/1) ... [2019-11-27 23:57:57,529 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:57:57" (1/1) ... [2019-11-27 23:57:57,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:57:57,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:57:57,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:57:57,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:57:57,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (1/1) ... [2019-11-27 23:57:57,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (1/1) ... [2019-11-27 23:57:57,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (1/1) ... [2019-11-27 23:57:57,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (1/1) ... [2019-11-27 23:57:57,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (1/1) ... [2019-11-27 23:57:57,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (1/1) ... [2019-11-27 23:57:57,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (1/1) ... [2019-11-27 23:57:57,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:57:57,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:57:57,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:57:57,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:57:57,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (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:57:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:57:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:57:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:57:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:57:57,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 23:57:57,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:57:57,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:57:58,046 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:57:58,046 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 23:57:58,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:57:58 BoogieIcfgContainer [2019-11-27 23:57:58,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:57:58,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:57:58,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:57:58,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:57:58,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:57:56" (1/3) ... [2019-11-27 23:57:58,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53171443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:57:58, skipping insertion in model container [2019-11-27 23:57:58,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:57:57" (2/3) ... [2019-11-27 23:57:58,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53171443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:57:58, skipping insertion in model container [2019-11-27 23:57:58,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:57:58" (3/3) ... [2019-11-27 23:57:58,054 INFO L109 eAbstractionObserver]: Analyzing ICFG cart.i [2019-11-27 23:57:58,063 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:57:58,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:57:58,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:57:58,096 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:57:58,096 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:57:58,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:57:58,096 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:57:58,096 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:57:58,096 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:57:58,097 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:57:58,097 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:57:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-27 23:57:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 23:57:58,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:58,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:58,115 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:58,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1597928625, now seen corresponding path program 1 times [2019-11-27 23:57:58,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:57:58,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125354794] [2019-11-27 23:57:58,129 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:57:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:58,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:57:58,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:57:58,229 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:57:58,229 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:57:58,233 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:57:58,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125354794] [2019-11-27 23:57:58,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:57:58,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:57:58,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461030566] [2019-11-27 23:57:58,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:57:58,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:57:58,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:57:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:57:58,255 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-27 23:57:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:58,269 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2019-11-27 23:57:58,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:57:58,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-27 23:57:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:58,280 INFO L225 Difference]: With dead ends: 33 [2019-11-27 23:57:58,280 INFO L226 Difference]: Without dead ends: 16 [2019-11-27 23:57:58,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:57:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-27 23:57:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-27 23:57:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-27 23:57:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-27 23:57:58,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 9 [2019-11-27 23:57:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:58,316 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-27 23:57:58,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:57:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2019-11-27 23:57:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:57:58,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:58,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:58,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:57:58,529 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1565257307, now seen corresponding path program 1 times [2019-11-27 23:57:58,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:57:58,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147142529] [2019-11-27 23:57:58,532 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:57:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:58,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:57:58,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:57:58,633 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:57:58,635 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:57:58,652 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:57:58,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147142529] [2019-11-27 23:57:58,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:57:58,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 23:57:58,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013668496] [2019-11-27 23:57:58,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:57:58,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:57:58,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:57:58,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:57:58,659 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 4 states. [2019-11-27 23:57:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:58,842 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-11-27 23:57:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:57:58,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-27 23:57:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:58,843 INFO L225 Difference]: With dead ends: 34 [2019-11-27 23:57:58,844 INFO L226 Difference]: Without dead ends: 19 [2019-11-27 23:57:58,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:57:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-27 23:57:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-27 23:57:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-27 23:57:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-27 23:57:58,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2019-11-27 23:57:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:58,851 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-27 23:57:58,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:57:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-11-27 23:57:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 23:57:58,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:58,852 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:59,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:57:59,066 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2088599158, now seen corresponding path program 1 times [2019-11-27 23:57:59,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:57:59,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944727712] [2019-11-27 23:57:59,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:57:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:59,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:57:59,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:57:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:57:59,149 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:57:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:57:59,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944727712] [2019-11-27 23:57:59,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:57:59,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 23:57:59,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100850428] [2019-11-27 23:57:59,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:57:59,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:57:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:57:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:57:59,170 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 4 states. [2019-11-27 23:57:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:59,364 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2019-11-27 23:57:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:57:59,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-27 23:57:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:59,366 INFO L225 Difference]: With dead ends: 34 [2019-11-27 23:57:59,366 INFO L226 Difference]: Without dead ends: 28 [2019-11-27 23:57:59,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:57:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-27 23:57:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-11-27 23:57:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-27 23:57:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-27 23:57:59,373 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-27 23:57:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:59,374 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-27 23:57:59,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:57:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-27 23:57:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:57:59,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:59,375 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:59,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:57:59,589 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1311378947, now seen corresponding path program 1 times [2019-11-27 23:57:59,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:57:59,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863982295] [2019-11-27 23:57:59,591 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:57:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:57:59,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:57:59,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:57:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:57:59,659 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:57:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:57:59,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863982295] [2019-11-27 23:57:59,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:57:59,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 23:57:59,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518591078] [2019-11-27 23:57:59,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:57:59,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:57:59,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:57:59,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:57:59,665 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-11-27 23:57:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:57:59,692 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2019-11-27 23:57:59,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:57:59,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 23:57:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:57:59,695 INFO L225 Difference]: With dead ends: 35 [2019-11-27 23:57:59,695 INFO L226 Difference]: Without dead ends: 25 [2019-11-27 23:57:59,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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:57:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-27 23:57:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-27 23:57:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 23:57:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-27 23:57:59,704 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2019-11-27 23:57:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:57:59,706 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-27 23:57:59,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:57:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-27 23:57:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:57:59,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:57:59,709 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:57:59,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:57:59,923 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:57:59,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:57:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash 502032321, now seen corresponding path program 1 times [2019-11-27 23:57:59,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:57:59,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024536934] [2019-11-27 23:57:59,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 23:58:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:00,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-27 23:58:00,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:00,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:00,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:00,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:00,112 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 25 treesize of output 19 [2019-11-27 23:58:00,113 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:00,132 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:00,133 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:00,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2019-11-27 23:58:00,318 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 0 case distinctions, treesize of input 59 treesize of output 48 [2019-11-27 23:58:00,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:00,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:00,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:00,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-27 23:58:00,334 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:00,349 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:00,350 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:00,390 INFO L588 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2019-11-27 23:58:00,391 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:00,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:30 [2019-11-27 23:58:00,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:00,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2019-11-27 23:58:00,465 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:00,474 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:00,474 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:00,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2019-11-27 23:58:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:00,508 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:58:00,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:00,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:58:01,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024536934] [2019-11-27 23:58:01,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:01,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-27 23:58:01,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653881732] [2019-11-27 23:58:01,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:58:01,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:58:01,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:58:01,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:58:01,038 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 15 states. [2019-11-27 23:58:01,852 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-27 23:58:02,492 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-27 23:58:02,729 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2019-11-27 23:58:02,938 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-11-27 23:58:03,398 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-27 23:58:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:03,798 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-11-27 23:58:03,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 23:58:03,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-27 23:58:03,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:03,800 INFO L225 Difference]: With dead ends: 49 [2019-11-27 23:58:03,801 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 23:58:03,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2019-11-27 23:58:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 23:58:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-11-27 23:58:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-27 23:58:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-11-27 23:58:03,811 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 18 [2019-11-27 23:58:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:03,811 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-27 23:58:03,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:58:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-11-27 23:58:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:58:03,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:03,812 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:04,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:58:04,034 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:04,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash 972646004, now seen corresponding path program 1 times [2019-11-27 23:58:04,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:58:04,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35320665] [2019-11-27 23:58:04,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 23:58:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:04,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 23:58:04,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:04,232 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:04,233 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:04,246 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:04,252 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:04,253 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:04,259 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:04,259 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:04,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-27 23:58:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:58:04,277 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:58:04,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:04,325 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 8 treesize of output 4 [2019-11-27 23:58:04,326 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:04,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:04,344 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 16 treesize of output 19 [2019-11-27 23:58:04,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:04,346 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-27 23:58:04,374 INFO L588 ElimStorePlain]: treesize reduction 17, result has 48.5 percent of original size [2019-11-27 23:58:04,378 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 8 treesize of output 4 [2019-11-27 23:58:04,378 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:04,384 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:04,385 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-27 23:58:04,385 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:7 [2019-11-27 23:58:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:58:04,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35320665] [2019-11-27 23:58:04,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:04,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-27 23:58:04,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615036131] [2019-11-27 23:58:04,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:58:04,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:58:04,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:58:04,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:58:04,391 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 8 states. [2019-11-27 23:58:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:04,859 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-11-27 23:58:04,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:58:04,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-27 23:58:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:04,864 INFO L225 Difference]: With dead ends: 57 [2019-11-27 23:58:04,864 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 23:58:04,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:58:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 23:58:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-11-27 23:58:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-27 23:58:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-11-27 23:58:04,873 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 21 [2019-11-27 23:58:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:04,873 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-27 23:58:04,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:58:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2019-11-27 23:58:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:58:04,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:04,874 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:05,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 23:58:05,087 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash 803189644, now seen corresponding path program 2 times [2019-11-27 23:58:05,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:58:05,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444994648] [2019-11-27 23:58:05,090 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 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 23:58:05,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:58:05,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:05,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 23:58:05,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:05,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:58:05,208 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,216 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:58:05,219 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,226 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,226 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-27 23:58:05,283 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:05,417 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-27 23:58:05,417 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,424 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:05,475 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,478 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:05,508 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,516 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 25 treesize of output 21 [2019-11-27 23:58:05,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:05,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:05,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:05,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:05,535 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:05,535 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,537 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,537 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,558 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,563 INFO L508 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:05,576 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,581 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 25 treesize of output 21 [2019-11-27 23:58:05,593 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 132 treesize of output 126 [2019-11-27 23:58:05,595 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-27 23:58:05,618 INFO L588 ElimStorePlain]: treesize reduction 119, result has 2.5 percent of original size [2019-11-27 23:58:05,619 INFO L508 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,623 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,623 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,623 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:105, output treesize:7 [2019-11-27 23:58:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:05,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:58:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:05,665 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:05,670 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,771 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,779 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,786 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:05,838 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,843 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,847 INFO L508 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:05,896 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,901 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:05,904 INFO L508 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:05,910 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:05,912 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-27 23:58:05,912 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:177, output treesize:35 [2019-11-27 23:58:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:05,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444994648] [2019-11-27 23:58:05,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:05,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-27 23:58:05,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133451394] [2019-11-27 23:58:05,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:58:05,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:58:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:58:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:58:05,931 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand 6 states. [2019-11-27 23:58:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:06,371 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-11-27 23:58:06,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:58:06,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-27 23:58:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:06,372 INFO L225 Difference]: With dead ends: 64 [2019-11-27 23:58:06,372 INFO L226 Difference]: Without dead ends: 37 [2019-11-27 23:58:06,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:58:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-27 23:58:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-27 23:58:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-27 23:58:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2019-11-27 23:58:06,380 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2019-11-27 23:58:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:06,380 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-11-27 23:58:06,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:58:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2019-11-27 23:58:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:58:06,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:06,381 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:06,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 23:58:06,595 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash 349213841, now seen corresponding path program 3 times [2019-11-27 23:58:06,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:58:06,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149572630] [2019-11-27 23:58:06,597 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 23:58:06,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 23:58:06,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:06,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-27 23:58:06,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:06,793 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:06,793 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:06,795 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:06,796 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:06,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:58:06,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:06,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2019-11-27 23:58:06,827 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:06,877 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:06,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:58:06,893 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:06,930 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:06,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:06,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:06,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:06,942 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 25 treesize of output 19 [2019-11-27 23:58:06,942 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:06,963 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:06,964 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:06,964 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:56, output treesize:31 [2019-11-27 23:58:07,157 INFO L404 ElimStorePlain]: Different costs {1=[|v_#memory_int_20|], 2=[|#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_23|]} [2019-11-27 23:58:07,168 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 0 case distinctions, treesize of input 59 treesize of output 48 [2019-11-27 23:58:07,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:07,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:07,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:07,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-27 23:58:07,192 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:07,207 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:07,208 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:07,333 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-27 23:58:07,334 INFO L588 ElimStorePlain]: treesize reduction 10, result has 88.9 percent of original size [2019-11-27 23:58:07,340 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:07,371 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:07,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:07,381 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 28 treesize of output 12 [2019-11-27 23:58:07,382 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:07,404 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:07,409 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 21 treesize of output 17 [2019-11-27 23:58:07,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:07,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:07,424 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 12 treesize of output 8 [2019-11-27 23:58:07,424 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:07,426 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:07,426 INFO L508 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:07,444 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:07,444 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:07,445 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:119, output treesize:34 [2019-11-27 23:58:07,479 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 0 case distinctions, treesize of input 56 treesize of output 50 [2019-11-27 23:58:07,519 INFO L343 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2019-11-27 23:58:07,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2019-11-27 23:58:07,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:07,524 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimArr_2], 1=[v_arrayElimArr_1]} [2019-11-27 23:58:07,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 23:58:07,729 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.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:07,734 INFO L168 Benchmark]: Toolchain (without parser) took 10844.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -63.2 MB). Peak memory consumption was 142.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:07,734 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:07,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:07,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.88 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:07,736 INFO L168 Benchmark]: Boogie Preprocessor took 36.16 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:07,736 INFO L168 Benchmark]: RCFGBuilder took 458.53 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.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:07,737 INFO L168 Benchmark]: TraceAbstraction took 9684.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:07,739 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 611.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.16 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 458.53 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.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9684.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.5 MB). Peak memory consumption was 135.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...