./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.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/Urban-WST2013-Fig2.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 31d0c4253184c01eb9f9573658b07bed7aa94585 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:55,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:23:55,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:23:55,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:23:55,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:23:55,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:23:55,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:23:55,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:23:55,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:23:55,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:23:55,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:23:55,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:23:55,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:23:55,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:23:55,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:23:55,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:23:55,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:23:55,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:23:55,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:23:55,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:23:55,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:23:55,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:23:55,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:23:55,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:23:55,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:23:55,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:23:55,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:23:55,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:23:55,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:23:55,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:23:55,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:23:55,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:23:55,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:23:55,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:23:55,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:23:55,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:23:55,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:23:55,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:23:55,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:23:55,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:23:55,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:23:55,116 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:55,148 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:23:55,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:23:55,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:23:55,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:23:55,150 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:23:55,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:23:55,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:23:55,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:23:55,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:23:55,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-29 01:23:55,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:23:55,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-29 01:23:55,153 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-07-29 01:23:55,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:23:55,154 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:23:55,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-29 01:23:55,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:23:55,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:23:55,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:23:55,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:23:55,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:23:55,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:23:55,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:23:55,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-29 01:23:55,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:23:55,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:23:55,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-29 01:23:55,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:23:55,157 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 -> 31d0c4253184c01eb9f9573658b07bed7aa94585 [2020-07-29 01:23:55,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:23:55,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:23:55,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:23:55,505 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:23:55,505 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:23:55,506 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2020-07-29 01:23:55,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e404088e4/98248f7b890645fcb960c74f75988064/FLAG82f7cbc6a [2020-07-29 01:23:55,995 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:23:55,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2020-07-29 01:23:56,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e404088e4/98248f7b890645fcb960c74f75988064/FLAG82f7cbc6a [2020-07-29 01:23:56,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e404088e4/98248f7b890645fcb960c74f75988064 [2020-07-29 01:23:56,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:23:56,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:23:56,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:23:56,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:23:56,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:23:56,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:23:56" (1/1) ... [2020-07-29 01:23:56,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1e2a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:56, skipping insertion in model container [2020-07-29 01:23:56,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:23:56" (1/1) ... [2020-07-29 01:23:56,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:23:56,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:23:56,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:23:56,696 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:23:56,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:23:56,730 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:23:56,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:56 WrapperNode [2020-07-29 01:23:56,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:23:56,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:23:56,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:23:56,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:23:56,742 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:56" (1/1) ... [2020-07-29 01:23:56,750 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:56" (1/1) ... [2020-07-29 01:23:56,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:23:56,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:23:56,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:23:56,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:23:56,852 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:56" (1/1) ... [2020-07-29 01:23:56,853 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:56" (1/1) ... [2020-07-29 01:23:56,853 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:56" (1/1) ... [2020-07-29 01:23:56,854 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:56" (1/1) ... [2020-07-29 01:23:56,856 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:56" (1/1) ... [2020-07-29 01:23:56,862 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:56" (1/1) ... [2020-07-29 01:23:56,863 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:56" (1/1) ... [2020-07-29 01:23:56,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:23:56,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:23:56,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:23:56,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:23:56,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:56" (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:56,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:23:56,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:23:57,176 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:23:57,176 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:23:57,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:23:57 BoogieIcfgContainer [2020-07-29 01:23:57,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:23:57,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:23:57,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:23:57,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:23:57,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:23:56" (1/3) ... [2020-07-29 01:23:57,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58410bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:23:57, skipping insertion in model container [2020-07-29 01:23:57,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:56" (2/3) ... [2020-07-29 01:23:57,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58410bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:23:57, skipping insertion in model container [2020-07-29 01:23:57,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:23:57" (3/3) ... [2020-07-29 01:23:57,190 INFO L109 eAbstractionObserver]: Analyzing ICFG Urban-WST2013-Fig2.c [2020-07-29 01:23:57,202 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:23:57,213 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-29 01:23:57,234 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-29 01:23:57,264 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:23:57,265 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-29 01:23:57,265 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:23:57,265 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:23:57,266 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:23:57,266 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:23:57,266 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:23:57,266 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:23:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-07-29 01:23:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-29 01:23:57,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:57,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-29 01:23:57,297 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash 963476, now seen corresponding path program 1 times [2020-07-29 01:23:57,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:57,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463708433] [2020-07-29 01:23:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:57,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {18#true} is VALID [2020-07-29 01:23:57,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {20#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:57,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {20#(<= 10 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {19#false} is VALID [2020-07-29 01:23:57,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {19#false} assume !(1 + main_~x1~0 <= 2147483647); {19#false} is VALID [2020-07-29 01:23:57,542 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:57,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463708433] [2020-07-29 01:23:57,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:57,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:23:57,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764476818] [2020-07-29 01:23:57,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-29 01:23:57,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:57,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:57,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:57,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:57,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:57,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:57,585 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-07-29 01:23:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:57,688 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-29 01:23:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:57,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-29 01:23:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-29 01:23:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-29 01:23:57,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2020-07-29 01:23:57,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:57,788 INFO L225 Difference]: With dead ends: 32 [2020-07-29 01:23:57,789 INFO L226 Difference]: Without dead ends: 14 [2020-07-29 01:23:57,792 INFO L675 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 [2020-07-29 01:23:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-29 01:23:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-29 01:23:57,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:57,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-29 01:23:57,831 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-29 01:23:57,831 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-29 01:23:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:57,834 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-07-29 01:23:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-29 01:23:57,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:57,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:57,835 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-29 01:23:57,836 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-29 01:23:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:57,838 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-07-29 01:23:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-29 01:23:57,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:57,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:57,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:57,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:23:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-07-29 01:23:57,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 4 [2020-07-29 01:23:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:57,843 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-29 01:23:57,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-29 01:23:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-29 01:23:57,844 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:57,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-29 01:23:57,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:23:57,845 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash 963531, now seen corresponding path program 1 times [2020-07-29 01:23:57,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:57,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516306402] [2020-07-29 01:23:57,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:57,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {107#true} is VALID [2020-07-29 01:23:57,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {109#(<= ULTIMATE.start_main_~x2~0 10)} is VALID [2020-07-29 01:23:57,884 INFO L280 TraceCheckUtils]: 2: Hoare triple {109#(<= ULTIMATE.start_main_~x2~0 10)} assume !!(main_~x2~0 > 1); {109#(<= ULTIMATE.start_main_~x2~0 10)} is VALID [2020-07-29 01:23:57,885 INFO L280 TraceCheckUtils]: 3: Hoare triple {109#(<= ULTIMATE.start_main_~x2~0 10)} assume !(main_~x2~0 - 1 <= 2147483647); {108#false} is VALID [2020-07-29 01:23:57,886 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:57,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516306402] [2020-07-29 01:23:57,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:57,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:57,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32493256] [2020-07-29 01:23:57,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-29 01:23:57,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:57,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:57,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:57,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:57,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:57,900 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2020-07-29 01:23:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:57,938 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:23:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:57,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-29 01:23:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-07-29 01:23:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-07-29 01:23:57,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2020-07-29 01:23:57,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:57,968 INFO L225 Difference]: With dead ends: 15 [2020-07-29 01:23:57,968 INFO L226 Difference]: Without dead ends: 14 [2020-07-29 01:23:57,969 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:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-29 01:23:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-29 01:23:57,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:57,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2020-07-29 01:23:57,978 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2020-07-29 01:23:57,978 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2020-07-29 01:23:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:57,980 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-29 01:23:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-29 01:23:57,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:57,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:57,981 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2020-07-29 01:23:57,981 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2020-07-29 01:23:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:57,984 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-29 01:23:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-29 01:23:57,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:57,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:57,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:57,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:23:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-29 01:23:57,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 4 [2020-07-29 01:23:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:57,988 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:23:57,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:23:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:23:57,989 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:57,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:57,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:23:57,990 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:57,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1360166603, now seen corresponding path program 1 times [2020-07-29 01:23:57,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:57,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987979518] [2020-07-29 01:23:57,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:58,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {175#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {175#true} is VALID [2020-07-29 01:23:58,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {175#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {177#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:58,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {177#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1); {177#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:58,054 INFO L280 TraceCheckUtils]: 3: Hoare triple {177#(<= 10 ULTIMATE.start_main_~x2~0)} assume main_~x2~0 - 1 <= 2147483647; {177#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:58,056 INFO L280 TraceCheckUtils]: 4: Hoare triple {177#(<= 10 ULTIMATE.start_main_~x2~0)} assume main_~x2~0 - 1 >= -2147483648;main_~x2~0 := main_~x2~0 - 1; {178#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:58,058 INFO L280 TraceCheckUtils]: 5: Hoare triple {178#(<= 9 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {176#false} is VALID [2020-07-29 01:23:58,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {176#false} assume !(1 + main_~x1~0 <= 2147483647); {176#false} is VALID [2020-07-29 01:23:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:58,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987979518] [2020-07-29 01:23:58,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120205824] [2020-07-29 01:23:58,060 INFO L95 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 [2020-07-29 01:23:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:58,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:23:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:58,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:23:58,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {175#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {175#true} is VALID [2020-07-29 01:23:58,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {175#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {185#(<= ULTIMATE.start_main_~x1~0 10)} is VALID [2020-07-29 01:23:58,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {185#(<= ULTIMATE.start_main_~x1~0 10)} assume !!(main_~x2~0 > 1); {185#(<= ULTIMATE.start_main_~x1~0 10)} is VALID [2020-07-29 01:23:58,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {185#(<= ULTIMATE.start_main_~x1~0 10)} assume main_~x2~0 - 1 <= 2147483647; {185#(<= ULTIMATE.start_main_~x1~0 10)} is VALID [2020-07-29 01:23:58,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {185#(<= ULTIMATE.start_main_~x1~0 10)} assume main_~x2~0 - 1 >= -2147483648;main_~x2~0 := main_~x2~0 - 1; {185#(<= ULTIMATE.start_main_~x1~0 10)} is VALID [2020-07-29 01:23:58,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {185#(<= ULTIMATE.start_main_~x1~0 10)} assume !(main_~x2~0 > 1); {185#(<= ULTIMATE.start_main_~x1~0 10)} is VALID [2020-07-29 01:23:58,148 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#(<= ULTIMATE.start_main_~x1~0 10)} assume !(1 + main_~x1~0 <= 2147483647); {176#false} is VALID [2020-07-29 01:23:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:23:58,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:23:58,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2020-07-29 01:23:58,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547680482] [2020-07-29 01:23:58,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:58,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:58,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:58,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:58,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:58,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:23:58,167 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-29 01:23:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:58,202 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:23:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:58,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-07-29 01:23:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-07-29 01:23:58,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2020-07-29 01:23:58,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:58,227 INFO L225 Difference]: With dead ends: 13 [2020-07-29 01:23:58,227 INFO L226 Difference]: Without dead ends: 12 [2020-07-29 01:23:58,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:23:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-29 01:23:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:23:58,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:58,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-29 01:23:58,238 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-29 01:23:58,238 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-29 01:23:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:58,240 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:23:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:23:58,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:58,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:58,241 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-29 01:23:58,241 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-29 01:23:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:58,243 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:23:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:23:58,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:58,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:58,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:58,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:23:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 01:23:58,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2020-07-29 01:23:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:58,247 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:23:58,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:23:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:23:58,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:58,249 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:58,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-29 01:23:58,468 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:58,468 INFO L82 PathProgramCache]: Analyzing trace with hash 784508327, now seen corresponding path program 1 times [2020-07-29 01:23:58,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:58,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821479985] [2020-07-29 01:23:58,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:58,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {255#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {255#true} is VALID [2020-07-29 01:23:58,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {255#true} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {257#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:58,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#(<= 10 ULTIMATE.start_main_~x2~0)} assume !!(main_~x2~0 > 1); {257#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:58,517 INFO L280 TraceCheckUtils]: 3: Hoare triple {257#(<= 10 ULTIMATE.start_main_~x2~0)} assume main_~x2~0 - 1 <= 2147483647; {257#(<= 10 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:58,519 INFO L280 TraceCheckUtils]: 4: Hoare triple {257#(<= 10 ULTIMATE.start_main_~x2~0)} assume main_~x2~0 - 1 >= -2147483648;main_~x2~0 := main_~x2~0 - 1; {258#(<= 9 ULTIMATE.start_main_~x2~0)} is VALID [2020-07-29 01:23:58,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {258#(<= 9 ULTIMATE.start_main_~x2~0)} assume !(main_~x2~0 > 1); {256#false} is VALID [2020-07-29 01:23:58,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {256#false} assume 1 + main_~x1~0 <= 2147483647; {256#false} is VALID [2020-07-29 01:23:58,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {256#false} assume !(1 + main_~x1~0 >= -2147483648); {256#false} is VALID [2020-07-29 01:23:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:58,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821479985] [2020-07-29 01:23:58,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91569997] [2020-07-29 01:23:58,522 INFO L95 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 [2020-07-29 01:23:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:58,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:23:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:58,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:23:58,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {255#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} is VALID [2020-07-29 01:23:58,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} is VALID [2020-07-29 01:23:58,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} assume !!(main_~x2~0 > 1); {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} is VALID [2020-07-29 01:23:58,649 INFO L280 TraceCheckUtils]: 3: Hoare triple {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} assume main_~x2~0 - 1 <= 2147483647; {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} is VALID [2020-07-29 01:23:58,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} assume main_~x2~0 - 1 >= -2147483648;main_~x2~0 := main_~x2~0 - 1; {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} is VALID [2020-07-29 01:23:58,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} assume !(main_~x2~0 > 1); {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} is VALID [2020-07-29 01:23:58,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} assume 1 + main_~x1~0 <= 2147483647; {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} is VALID [2020-07-29 01:23:58,653 INFO L280 TraceCheckUtils]: 7: Hoare triple {262#(<= 0 (+ ULTIMATE.start_main_~x1~0 2147483648))} assume !(1 + main_~x1~0 >= -2147483648); {256#false} is VALID [2020-07-29 01:23:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:23:58,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:23:58,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2020-07-29 01:23:58,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559516919] [2020-07-29 01:23:58,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-29 01:23:58,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:58,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:58,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:58,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:58,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:58,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:23:58,670 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2020-07-29 01:23:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:58,697 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:23:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:58,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-29 01:23:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:23:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:23:58,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2020-07-29 01:23:58,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:58,722 INFO L225 Difference]: With dead ends: 12 [2020-07-29 01:23:58,722 INFO L226 Difference]: Without dead ends: 11 [2020-07-29 01:23:58,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:23:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-29 01:23:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:23:58,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:58,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2020-07-29 01:23:58,734 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-29 01:23:58,735 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-29 01:23:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:58,736 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:23:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:23:58,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:58,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:58,737 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-29 01:23:58,737 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-29 01:23:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:58,739 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:23:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:23:58,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:58,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:58,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:58,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:23:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 01:23:58,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2020-07-29 01:23:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:58,742 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:23:58,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:23:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:23:58,743 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:58,743 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:23:58,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:23:58,944 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash 784510025, now seen corresponding path program 1 times [2020-07-29 01:23:58,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:58,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376675680] [2020-07-29 01:23:58,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:58,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:23:58,959 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:58,965 INFO L168 Benchmark]: Toolchain (without parser) took 2525.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 957.5 MB in the beginning and 979.8 MB in the end (delta: -22.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:58,966 INFO L168 Benchmark]: CDTParser took 0.28 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:58,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.51 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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:58,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:58,972 INFO L168 Benchmark]: Boogie Preprocessor took 19.17 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. [2020-07-29 01:23:58,973 INFO L168 Benchmark]: RCFGBuilder took 315.86 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:58,977 INFO L168 Benchmark]: TraceAbstraction took 1780.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.8 MB in the end (delta: 117.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:58,983 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.28 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 288.51 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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 113.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.17 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. * RCFGBuilder took 315.86 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1780.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.8 MB in the end (delta: 117.7 MB). Peak memory consumption was 117.7 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...