./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94419cb5ed7b14b2ed497048686126b88cc40ca2 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:27:16,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:27:16,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:27:16,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:27:16,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:27:16,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:27:16,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:27:16,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:27:16,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:27:16,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:27:16,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:27:16,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:27:16,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:27:16,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:27:16,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:27:16,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:27:16,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:27:16,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:27:16,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:27:16,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:27:16,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:27:16,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:27:16,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:27:16,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:27:16,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:27:16,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:27:16,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:27:16,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:27:16,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:27:16,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:27:16,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:27:16,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:27:16,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:27:16,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:27:16,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:27:16,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:27:16,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:27:16,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:27:16,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:27:16,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:27:16,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:27:16,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 20:27:16,394 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:27:16,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:27:16,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:27:16,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:27:16,396 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:27:16,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:27:16,397 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:27:16,397 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:27:16,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:27:16,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:27:16,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:27:16,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:27:16,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:27:16,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:27:16,400 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:27:16,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:27:16,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:27:16,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:27:16,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:27:16,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:27:16,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:27:16,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:27:16,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:27:16,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:27:16,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:27:16,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:27:16,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:27:16,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:27:16,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:27:16,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:27:16,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:27:16,404 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94419cb5ed7b14b2ed497048686126b88cc40ca2 [2019-11-28 20:27:16,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:27:16,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:27:16,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:27:16,745 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:27:16,746 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:27:16,746 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2019-11-28 20:27:16,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd71d99f/dcb2eec2ab374a8c94513531ad48605b/FLAGce1d99356 [2019-11-28 20:27:17,281 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:27:17,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2019-11-28 20:27:17,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd71d99f/dcb2eec2ab374a8c94513531ad48605b/FLAGce1d99356 [2019-11-28 20:27:17,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd71d99f/dcb2eec2ab374a8c94513531ad48605b [2019-11-28 20:27:17,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:27:17,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:27:17,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:17,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:27:17,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:27:17,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:17" (1/1) ... [2019-11-28 20:27:17,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4330d1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17, skipping insertion in model container [2019-11-28 20:27:17,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:17" (1/1) ... [2019-11-28 20:27:17,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:27:17,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:27:18,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:18,064 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:27:18,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:18,161 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:27:18,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18 WrapperNode [2019-11-28 20:27:18,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:18,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:18,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:27:18,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:27:18,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:18,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:27:18,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:27:18,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:27:18,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... [2019-11-28 20:27:18,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:27:18,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:27:18,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:27:18,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:27:18,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:27:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:27:18,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:27:18,884 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:27:18,884 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-28 20:27:18,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:18 BoogieIcfgContainer [2019-11-28 20:27:18,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:27:18,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:27:18,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:27:18,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:27:18,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:27:17" (1/3) ... [2019-11-28 20:27:18,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4064ffd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:18, skipping insertion in model container [2019-11-28 20:27:18,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:18" (2/3) ... [2019-11-28 20:27:18,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4064ffd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:18, skipping insertion in model container [2019-11-28 20:27:18,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:18" (3/3) ... [2019-11-28 20:27:18,896 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2019-11-28 20:27:18,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:27:18,913 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-11-28 20:27:18,928 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-11-28 20:27:18,968 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:27:18,968 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:27:18,968 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:27:18,968 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:27:18,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:27:18,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:27:18,969 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:27:18,969 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:27:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-28 20:27:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:27:18,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:18,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,000 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,005 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-11-28 20:27:19,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731755946] [2019-11-28 20:27:19,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:19,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731755946] [2019-11-28 20:27:19,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:19,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:19,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12882592] [2019-11-28 20:27:19,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 20:27:19,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:27:19,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:27:19,145 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 2 states. [2019-11-28 20:27:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:19,181 INFO L93 Difference]: Finished difference Result 271 states and 357 transitions. [2019-11-28 20:27:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:27:19,183 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-28 20:27:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:19,196 INFO L225 Difference]: With dead ends: 271 [2019-11-28 20:27:19,197 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 20:27:19,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:27:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 20:27:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-11-28 20:27:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 20:27:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2019-11-28 20:27:19,250 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 6 [2019-11-28 20:27:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:19,250 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2019-11-28 20:27:19,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 20:27:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2019-11-28 20:27:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:27:19,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:19,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,253 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-11-28 20:27:19,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501788827] [2019-11-28 20:27:19,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:19,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501788827] [2019-11-28 20:27:19,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:19,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:19,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361701640] [2019-11-28 20:27:19,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:19,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:19,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:19,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:19,319 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 4 states. [2019-11-28 20:27:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:19,529 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2019-11-28 20:27:19,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:19,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-28 20:27:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:19,532 INFO L225 Difference]: With dead ends: 290 [2019-11-28 20:27:19,535 INFO L226 Difference]: Without dead ends: 166 [2019-11-28 20:27:19,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-28 20:27:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 106. [2019-11-28 20:27:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 20:27:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-11-28 20:27:19,565 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 6 [2019-11-28 20:27:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:19,567 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-11-28 20:27:19,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-11-28 20:27:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:27:19,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:19,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,568 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,570 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-11-28 20:27:19,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155113137] [2019-11-28 20:27:19,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:19,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155113137] [2019-11-28 20:27:19,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:19,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:19,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941513641] [2019-11-28 20:27:19,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:19,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:19,656 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 4 states. [2019-11-28 20:27:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:19,749 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2019-11-28 20:27:19,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:19,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 20:27:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:19,752 INFO L225 Difference]: With dead ends: 173 [2019-11-28 20:27:19,752 INFO L226 Difference]: Without dead ends: 169 [2019-11-28 20:27:19,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-28 20:27:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 107. [2019-11-28 20:27:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 20:27:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-11-28 20:27:19,778 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 9 [2019-11-28 20:27:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:19,778 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-11-28 20:27:19,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2019-11-28 20:27:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:27:19,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:19,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,781 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-11-28 20:27:19,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476582583] [2019-11-28 20:27:19,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:19,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476582583] [2019-11-28 20:27:19,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:19,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:19,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41968697] [2019-11-28 20:27:19,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:19,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:19,840 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand 3 states. [2019-11-28 20:27:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:19,911 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2019-11-28 20:27:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:19,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 20:27:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:19,915 INFO L225 Difference]: With dead ends: 167 [2019-11-28 20:27:19,915 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 20:27:19,916 INFO L630 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 [2019-11-28 20:27:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 20:27:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 105. [2019-11-28 20:27:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 20:27:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-28 20:27:19,941 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 10 [2019-11-28 20:27:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:19,941 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-28 20:27:19,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-11-28 20:27:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:27:19,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:19,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,943 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-11-28 20:27:19,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458549087] [2019-11-28 20:27:19,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:19,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458549087] [2019-11-28 20:27:19,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:19,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:19,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994583360] [2019-11-28 20:27:19,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:19,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:19,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:19,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:19,990 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 4 states. [2019-11-28 20:27:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:20,066 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2019-11-28 20:27:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:20,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:27:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:20,070 INFO L225 Difference]: With dead ends: 171 [2019-11-28 20:27:20,070 INFO L226 Difference]: Without dead ends: 169 [2019-11-28 20:27:20,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-28 20:27:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 107. [2019-11-28 20:27:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 20:27:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-11-28 20:27:20,088 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 11 [2019-11-28 20:27:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:20,088 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-11-28 20:27:20,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2019-11-28 20:27:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:27:20,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:20,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:20,090 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:20,091 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-11-28 20:27:20,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:20,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557842519] [2019-11-28 20:27:20,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:20,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557842519] [2019-11-28 20:27:20,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:20,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:20,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197476582] [2019-11-28 20:27:20,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:20,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:20,146 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand 4 states. [2019-11-28 20:27:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:20,220 INFO L93 Difference]: Finished difference Result 174 states and 202 transitions. [2019-11-28 20:27:20,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:20,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 20:27:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:20,222 INFO L225 Difference]: With dead ends: 174 [2019-11-28 20:27:20,223 INFO L226 Difference]: Without dead ends: 172 [2019-11-28 20:27:20,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-28 20:27:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 110. [2019-11-28 20:27:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 20:27:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2019-11-28 20:27:20,242 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 12 [2019-11-28 20:27:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:20,243 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2019-11-28 20:27:20,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2019-11-28 20:27:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:27:20,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:20,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:20,251 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-11-28 20:27:20,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:20,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016700639] [2019-11-28 20:27:20,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:20,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016700639] [2019-11-28 20:27:20,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:20,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:20,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321087291] [2019-11-28 20:27:20,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:20,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:20,313 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand 4 states. [2019-11-28 20:27:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:20,393 INFO L93 Difference]: Finished difference Result 238 states and 272 transitions. [2019-11-28 20:27:20,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:20,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 20:27:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:20,395 INFO L225 Difference]: With dead ends: 238 [2019-11-28 20:27:20,396 INFO L226 Difference]: Without dead ends: 236 [2019-11-28 20:27:20,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-28 20:27:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 109. [2019-11-28 20:27:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 20:27:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2019-11-28 20:27:20,406 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 14 [2019-11-28 20:27:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:20,407 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2019-11-28 20:27:20,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2019-11-28 20:27:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:27:20,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:20,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:20,409 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:20,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1259484934, now seen corresponding path program 1 times [2019-11-28 20:27:20,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:20,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465691686] [2019-11-28 20:27:20,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:20,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465691686] [2019-11-28 20:27:20,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:20,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:27:20,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393164025] [2019-11-28 20:27:20,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:27:20,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:20,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:27:20,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:27:20,571 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand 8 states. [2019-11-28 20:27:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:20,973 INFO L93 Difference]: Finished difference Result 267 states and 313 transitions. [2019-11-28 20:27:20,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:27:20,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-28 20:27:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:20,975 INFO L225 Difference]: With dead ends: 267 [2019-11-28 20:27:20,976 INFO L226 Difference]: Without dead ends: 197 [2019-11-28 20:27:20,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:27:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-28 20:27:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 158. [2019-11-28 20:27:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 20:27:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2019-11-28 20:27:20,992 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 14 [2019-11-28 20:27:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:20,993 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2019-11-28 20:27:20,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:27:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2019-11-28 20:27:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:27:20,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:20,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:20,995 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-11-28 20:27:20,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:20,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374730469] [2019-11-28 20:27:20,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:21,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374730469] [2019-11-28 20:27:21,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:21,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:21,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23478208] [2019-11-28 20:27:21,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:21,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:21,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:21,039 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand 4 states. [2019-11-28 20:27:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:21,112 INFO L93 Difference]: Finished difference Result 247 states and 296 transitions. [2019-11-28 20:27:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:21,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 20:27:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:21,115 INFO L225 Difference]: With dead ends: 247 [2019-11-28 20:27:21,115 INFO L226 Difference]: Without dead ends: 245 [2019-11-28 20:27:21,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-28 20:27:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 150. [2019-11-28 20:27:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 20:27:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2019-11-28 20:27:21,127 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 183 transitions. Word has length 14 [2019-11-28 20:27:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:21,127 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 183 transitions. [2019-11-28 20:27:21,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2019-11-28 20:27:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:27:21,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:21,129 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:21,130 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:21,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:21,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-11-28 20:27:21,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:21,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613306186] [2019-11-28 20:27:21,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:21,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613306186] [2019-11-28 20:27:21,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:21,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:21,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699075923] [2019-11-28 20:27:21,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:21,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:21,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:21,190 INFO L87 Difference]: Start difference. First operand 150 states and 183 transitions. Second operand 4 states. [2019-11-28 20:27:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:21,268 INFO L93 Difference]: Finished difference Result 272 states and 322 transitions. [2019-11-28 20:27:21,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:21,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 20:27:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:21,271 INFO L225 Difference]: With dead ends: 272 [2019-11-28 20:27:21,271 INFO L226 Difference]: Without dead ends: 270 [2019-11-28 20:27:21,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-28 20:27:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 136. [2019-11-28 20:27:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 20:27:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2019-11-28 20:27:21,287 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 15 [2019-11-28 20:27:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:21,287 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2019-11-28 20:27:21,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2019-11-28 20:27:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:27:21,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:21,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:21,293 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1435914485, now seen corresponding path program 1 times [2019-11-28 20:27:21,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:21,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413457784] [2019-11-28 20:27:21,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:21,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413457784] [2019-11-28 20:27:21,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:21,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:27:21,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580004352] [2019-11-28 20:27:21,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:27:21,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:27:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:27:21,469 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand 6 states. [2019-11-28 20:27:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:21,665 INFO L93 Difference]: Finished difference Result 245 states and 291 transitions. [2019-11-28 20:27:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:21,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 20:27:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:21,668 INFO L225 Difference]: With dead ends: 245 [2019-11-28 20:27:21,668 INFO L226 Difference]: Without dead ends: 244 [2019-11-28 20:27:21,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:27:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-28 20:27:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 152. [2019-11-28 20:27:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 20:27:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2019-11-28 20:27:21,682 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 20 [2019-11-28 20:27:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:21,682 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2019-11-28 20:27:21,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:27:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2019-11-28 20:27:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:27:21,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:21,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:21,684 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1468941615, now seen corresponding path program 1 times [2019-11-28 20:27:21,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:21,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519566703] [2019-11-28 20:27:21,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:21,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519566703] [2019-11-28 20:27:21,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:21,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:27:21,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821169000] [2019-11-28 20:27:21,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:27:21,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:27:21,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:27:21,847 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand 9 states. [2019-11-28 20:27:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:22,297 INFO L93 Difference]: Finished difference Result 478 states and 553 transitions. [2019-11-28 20:27:22,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:27:22,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 20:27:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:22,302 INFO L225 Difference]: With dead ends: 478 [2019-11-28 20:27:22,302 INFO L226 Difference]: Without dead ends: 423 [2019-11-28 20:27:22,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:27:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-11-28 20:27:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 216. [2019-11-28 20:27:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-28 20:27:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 267 transitions. [2019-11-28 20:27:22,325 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 267 transitions. Word has length 22 [2019-11-28 20:27:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:22,326 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 267 transitions. [2019-11-28 20:27:22,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:27:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 267 transitions. [2019-11-28 20:27:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:27:22,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:22,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:22,327 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1469001197, now seen corresponding path program 1 times [2019-11-28 20:27:22,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:22,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837081307] [2019-11-28 20:27:22,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:22,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837081307] [2019-11-28 20:27:22,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:22,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:27:22,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731256575] [2019-11-28 20:27:22,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:27:22,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:27:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:27:22,476 INFO L87 Difference]: Start difference. First operand 216 states and 267 transitions. Second operand 8 states. [2019-11-28 20:27:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:22,725 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2019-11-28 20:27:22,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:27:22,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-28 20:27:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:22,727 INFO L225 Difference]: With dead ends: 286 [2019-11-28 20:27:22,727 INFO L226 Difference]: Without dead ends: 285 [2019-11-28 20:27:22,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:27:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-28 20:27:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 225. [2019-11-28 20:27:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-28 20:27:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 278 transitions. [2019-11-28 20:27:22,746 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 278 transitions. Word has length 22 [2019-11-28 20:27:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:22,746 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 278 transitions. [2019-11-28 20:27:22,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:27:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 278 transitions. [2019-11-28 20:27:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:27:22,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:22,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:22,747 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1229309041, now seen corresponding path program 1 times [2019-11-28 20:27:22,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:22,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487976288] [2019-11-28 20:27:22,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:22,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487976288] [2019-11-28 20:27:22,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:22,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:27:22,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736283670] [2019-11-28 20:27:22,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:27:22,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:22,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:27:22,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:27:22,958 INFO L87 Difference]: Start difference. First operand 225 states and 278 transitions. Second operand 8 states. [2019-11-28 20:27:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:23,446 INFO L93 Difference]: Finished difference Result 400 states and 480 transitions. [2019-11-28 20:27:23,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:27:23,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-28 20:27:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:23,449 INFO L225 Difference]: With dead ends: 400 [2019-11-28 20:27:23,449 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 20:27:23,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:27:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 20:27:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 258. [2019-11-28 20:27:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-28 20:27:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 321 transitions. [2019-11-28 20:27:23,472 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 321 transitions. Word has length 22 [2019-11-28 20:27:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:23,474 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 321 transitions. [2019-11-28 20:27:23,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:27:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 321 transitions. [2019-11-28 20:27:23,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:27:23,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:23,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:23,475 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:23,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1239889621, now seen corresponding path program 1 times [2019-11-28 20:27:23,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:23,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734894109] [2019-11-28 20:27:23,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:23,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734894109] [2019-11-28 20:27:23,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:23,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:27:23,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214318077] [2019-11-28 20:27:23,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:27:23,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:27:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:27:23,605 INFO L87 Difference]: Start difference. First operand 258 states and 321 transitions. Second operand 8 states. [2019-11-28 20:27:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:23,797 INFO L93 Difference]: Finished difference Result 296 states and 352 transitions. [2019-11-28 20:27:23,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:27:23,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-28 20:27:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:23,799 INFO L225 Difference]: With dead ends: 296 [2019-11-28 20:27:23,799 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 20:27:23,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:27:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 20:27:23,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 201. [2019-11-28 20:27:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-28 20:27:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions. [2019-11-28 20:27:23,820 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 249 transitions. Word has length 22 [2019-11-28 20:27:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:23,820 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 249 transitions. [2019-11-28 20:27:23,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:27:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions. [2019-11-28 20:27:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:27:23,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:23,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:23,822 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1089831035, now seen corresponding path program 1 times [2019-11-28 20:27:23,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:23,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216915002] [2019-11-28 20:27:23,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:23,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216915002] [2019-11-28 20:27:23,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:23,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:27:23,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847935641] [2019-11-28 20:27:23,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:27:23,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:23,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:27:23,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:27:23,915 INFO L87 Difference]: Start difference. First operand 201 states and 249 transitions. Second operand 8 states. [2019-11-28 20:27:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:24,156 INFO L93 Difference]: Finished difference Result 237 states and 285 transitions. [2019-11-28 20:27:24,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:27:24,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 20:27:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:24,158 INFO L225 Difference]: With dead ends: 237 [2019-11-28 20:27:24,159 INFO L226 Difference]: Without dead ends: 188 [2019-11-28 20:27:24,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:27:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-28 20:27:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2019-11-28 20:27:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 20:27:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 226 transitions. [2019-11-28 20:27:24,173 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 226 transitions. Word has length 24 [2019-11-28 20:27:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:24,173 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 226 transitions. [2019-11-28 20:27:24,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:27:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2019-11-28 20:27:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:27:24,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:24,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:24,175 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1968302766, now seen corresponding path program 1 times [2019-11-28 20:27:24,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:24,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632626193] [2019-11-28 20:27:24,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:24,515 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-11-28 20:27:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:24,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632626193] [2019-11-28 20:27:24,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:24,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:27:24,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204413670] [2019-11-28 20:27:24,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:27:24,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:27:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:27:24,603 INFO L87 Difference]: Start difference. First operand 184 states and 226 transitions. Second operand 8 states. [2019-11-28 20:27:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:24,953 INFO L93 Difference]: Finished difference Result 265 states and 314 transitions. [2019-11-28 20:27:24,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:27:24,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 20:27:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:24,955 INFO L225 Difference]: With dead ends: 265 [2019-11-28 20:27:24,955 INFO L226 Difference]: Without dead ends: 264 [2019-11-28 20:27:24,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:27:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-28 20:27:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 184. [2019-11-28 20:27:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 20:27:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2019-11-28 20:27:24,979 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 24 [2019-11-28 20:27:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:24,979 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2019-11-28 20:27:24,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:27:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2019-11-28 20:27:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:27:24,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:24,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:24,981 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1696098322, now seen corresponding path program 1 times [2019-11-28 20:27:24,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:24,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860549311] [2019-11-28 20:27:24,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:27:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:27:25,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:27:25,069 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:27:25,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:27:25 BoogieIcfgContainer [2019-11-28 20:27:25,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:27:25,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:27:25,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:27:25,120 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:27:25,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:18" (3/4) ... [2019-11-28 20:27:25,125 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:27:25,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:27:25,134 INFO L168 Benchmark]: Toolchain (without parser) took 7499.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 77.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:25,134 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:25,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -204.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:25,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:25,143 INFO L168 Benchmark]: Boogie Preprocessor took 38.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:25,143 INFO L168 Benchmark]: RCFGBuilder took 624.31 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: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:25,145 INFO L168 Benchmark]: TraceAbstraction took 6232.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.6 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:25,145 INFO L168 Benchmark]: Witness Printer took 5.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:25,153 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -204.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 624.31 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: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6232.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.6 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add1 ; [L224] unsigned int r_add2 ; [L225] unsigned int zero ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int __retres14 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L232] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] EXPR e + 128 [L68] res = m | ((unsigned int )(e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L233] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND TRUE m >= 1U << 25U [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U [L71] return (__retres4); [L234] b = base2flt(mb, eb) [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] EXPR (int )(a >> 24U) - 128 [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 38 error locations. Result: UNSAFE, OverallTime: 6.1s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2467 SDtfs, 3174 SDslu, 5632 SDs, 0 SdLazy, 1577 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 22248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...