./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:23:07,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:23:07,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:23:07,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:23:07,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:23:07,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:23:07,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:23:07,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:23:07,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:23:07,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:23:07,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:23:07,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:23:07,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:23:07,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:23:07,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:23:07,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:23:07,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:23:07,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:23:07,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:23:07,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:23:07,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:23:07,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:23:07,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:23:07,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:23:07,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:23:07,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:23:07,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:23:07,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:23:07,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:23:07,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:23:07,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:23:07,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:23:07,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:23:07,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:23:07,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:23:07,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:23:07,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:23:07,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:23:07,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:23:07,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:23:07,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:23:07,138 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2020-07-29 01:23:07,153 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:23:07,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:23:07,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:23:07,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:23:07,156 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:23:07,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:23:07,157 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:23:07,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:23:07,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:23:07,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-29 01:23:07,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:23:07,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-29 01:23:07,158 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-07-29 01:23:07,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:23:07,159 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:23:07,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-29 01:23:07,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:23:07,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:23:07,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:23:07,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:23:07,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:23:07,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:23:07,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:23:07,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-29 01:23:07,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:23:07,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:23:07,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-29 01:23:07,162 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:23:07,163 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2020-07-29 01:23:07,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:23:07,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:23:07,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:23:07,508 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:23:07,508 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:23:07,510 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-07-29 01:23:07,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/952151bde/5d3eed91772542d98d3936f9a9adb05f/FLAG7685428ed [2020-07-29 01:23:08,020 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:23:08,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-07-29 01:23:08,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/952151bde/5d3eed91772542d98d3936f9a9adb05f/FLAG7685428ed [2020-07-29 01:23:08,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/952151bde/5d3eed91772542d98d3936f9a9adb05f [2020-07-29 01:23:08,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:23:08,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:23:08,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:23:08,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:23:08,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:23:08,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46fcb1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08, skipping insertion in model container [2020-07-29 01:23:08,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:23:08,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:23:08,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:23:08,627 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:23:08,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:23:08,660 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:23:08,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08 WrapperNode [2020-07-29 01:23:08,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:23:08,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:23:08,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:23:08,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:23:08,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:23:08,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:23:08,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:23:08,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:23:08,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (1/1) ... [2020-07-29 01:23:08,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:23:08,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:23:08,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:23:08,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:23:08,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (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 [2020-07-29 01:23:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:23:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:23:09,172 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:23:09,172 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:23:09,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:23:09 BoogieIcfgContainer [2020-07-29 01:23:09,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:23:09,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:23:09,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:23:09,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:23:09,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:23:08" (1/3) ... [2020-07-29 01:23:09,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601b9387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:23:09, skipping insertion in model container [2020-07-29 01:23:09,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:08" (2/3) ... [2020-07-29 01:23:09,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601b9387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:23:09, skipping insertion in model container [2020-07-29 01:23:09,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:23:09" (3/3) ... [2020-07-29 01:23:09,186 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-07-29 01:23:09,198 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:23:09,206 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-29 01:23:09,221 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-29 01:23:09,244 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:23:09,244 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-29 01:23:09,244 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:23:09,245 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:23:09,245 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:23:09,245 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:23:09,245 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:23:09,245 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:23:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-29 01:23:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-29 01:23:09,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:09,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-29 01:23:09,271 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash 29685899, now seen corresponding path program 1 times [2020-07-29 01:23:09,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:09,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146981452] [2020-07-29 01:23:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:09,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {29#true} is VALID [2020-07-29 01:23:09,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {29#true} is VALID [2020-07-29 01:23:09,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#true} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {29#true} is VALID [2020-07-29 01:23:09,430 INFO L280 TraceCheckUtils]: 3: Hoare triple {29#true} assume !true; {30#false} is VALID [2020-07-29 01:23:09,431 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#false} assume !(1 + main_~i~0 <= 2147483647); {30#false} is VALID [2020-07-29 01:23:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:09,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146981452] [2020-07-29 01:23:09,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:09,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:09,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855496174] [2020-07-29 01:23:09,440 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-29 01:23:09,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:09,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:23:09,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:09,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-29 01:23:09,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:23:09,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:23:09,508 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2020-07-29 01:23:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:09,577 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2020-07-29 01:23:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:23:09,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-29 01:23:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:23:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-29 01:23:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:23:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-29 01:23:09,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2020-07-29 01:23:09,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:09,730 INFO L225 Difference]: With dead ends: 50 [2020-07-29 01:23:09,730 INFO L226 Difference]: Without dead ends: 22 [2020-07-29 01:23:09,734 INFO L675 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 [2020-07-29 01:23:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-29 01:23:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-29 01:23:09,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:09,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-29 01:23:09,772 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-29 01:23:09,772 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-29 01:23:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:09,776 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-29 01:23:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-29 01:23:09,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:09,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:09,777 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-29 01:23:09,778 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-29 01:23:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:09,780 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-29 01:23:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-29 01:23:09,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:09,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:09,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:09,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:23:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-29 01:23:09,791 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2020-07-29 01:23:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:09,792 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:23:09,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-29 01:23:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-29 01:23:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-29 01:23:09,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:09,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-29 01:23:09,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:23:09,795 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:09,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:09,796 INFO L82 PathProgramCache]: Analyzing trace with hash 29685000, now seen corresponding path program 1 times [2020-07-29 01:23:09,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:09,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833805318] [2020-07-29 01:23:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:09,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {160#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {160#true} is VALID [2020-07-29 01:23:09,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#true} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {162#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:23:09,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {162#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {162#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:23:09,905 INFO L280 TraceCheckUtils]: 3: Hoare triple {162#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_~j~0 < main_~m~0); {162#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:23:09,906 INFO L280 TraceCheckUtils]: 4: Hoare triple {162#(<= ULTIMATE.start_main_~i~0 0)} assume !(1 + main_~i~0 <= 2147483647); {161#false} is VALID [2020-07-29 01:23:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:09,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833805318] [2020-07-29 01:23:09,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:09,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:09,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321713808] [2020-07-29 01:23:09,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-29 01:23:09,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:09,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:09,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:09,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:09,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:09,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:09,920 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2020-07-29 01:23:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:10,030 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-29 01:23:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:10,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-29 01:23:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2020-07-29 01:23:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2020-07-29 01:23:10,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2020-07-29 01:23:10,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:10,130 INFO L225 Difference]: With dead ends: 41 [2020-07-29 01:23:10,131 INFO L226 Difference]: Without dead ends: 40 [2020-07-29 01:23:10,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-29 01:23:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2020-07-29 01:23:10,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:10,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 25 states. [2020-07-29 01:23:10,152 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 25 states. [2020-07-29 01:23:10,152 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 25 states. [2020-07-29 01:23:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:10,160 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-07-29 01:23:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-29 01:23:10,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:10,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:10,162 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 40 states. [2020-07-29 01:23:10,162 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 40 states. [2020-07-29 01:23:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:10,167 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-07-29 01:23:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-29 01:23:10,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:10,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:10,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:10,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:23:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-29 01:23:10,182 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2020-07-29 01:23:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:10,185 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-29 01:23:10,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-29 01:23:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-29 01:23:10,186 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:10,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-29 01:23:10,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:23:10,188 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2020-07-29 01:23:10,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:10,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006755253] [2020-07-29 01:23:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:10,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {322#true} is VALID [2020-07-29 01:23:10,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {322#true} is VALID [2020-07-29 01:23:10,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {322#true} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {324#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-29 01:23:10,276 INFO L280 TraceCheckUtils]: 3: Hoare triple {324#(<= ULTIMATE.start_main_~j~0 0)} assume !!(main_~j~0 < main_~m~0); {324#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-29 01:23:10,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {324#(<= ULTIMATE.start_main_~j~0 0)} assume !(1 + main_~j~0 <= 2147483647); {323#false} is VALID [2020-07-29 01:23:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:10,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006755253] [2020-07-29 01:23:10,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:10,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:10,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197387698] [2020-07-29 01:23:10,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-29 01:23:10,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:10,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:10,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:10,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:10,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:10,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:10,290 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2020-07-29 01:23:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:10,373 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-29 01:23:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:10,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-29 01:23:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2020-07-29 01:23:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2020-07-29 01:23:10,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2020-07-29 01:23:10,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:10,428 INFO L225 Difference]: With dead ends: 34 [2020-07-29 01:23:10,428 INFO L226 Difference]: Without dead ends: 33 [2020-07-29 01:23:10,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-29 01:23:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-07-29 01:23:10,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:10,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 27 states. [2020-07-29 01:23:10,441 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 27 states. [2020-07-29 01:23:10,441 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 27 states. [2020-07-29 01:23:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:10,444 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-29 01:23:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-29 01:23:10,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:10,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:10,446 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 33 states. [2020-07-29 01:23:10,446 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 33 states. [2020-07-29 01:23:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:10,449 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-29 01:23:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-29 01:23:10,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:10,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:10,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:10,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:23:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-29 01:23:10,454 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2020-07-29 01:23:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:10,454 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 01:23:10,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-29 01:23:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-29 01:23:10,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:10,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:23:10,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:23:10,457 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash 920235084, now seen corresponding path program 1 times [2020-07-29 01:23:10,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:10,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238829757] [2020-07-29 01:23:10,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:10,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:23:10,473 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) 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:317) 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) [2020-07-29 01:23:10,486 INFO L168 Benchmark]: Toolchain (without parser) took 2086.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 960.2 MB in the beginning and 993.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 95.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:10,486 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:23:10,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.19 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:10,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:23:10,489 INFO L168 Benchmark]: Boogie Preprocessor took 81.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:10,490 INFO L168 Benchmark]: RCFGBuilder took 396.32 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:10,491 INFO L168 Benchmark]: TraceAbstraction took 1302.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.6 MB in the end (delta: 93.1 MB). Peak memory consumption was 93.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:10,496 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.64 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.19 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 396.32 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1302.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.6 MB in the end (delta: 93.1 MB). Peak memory consumption was 93.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...