./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-numeric/MultCommutative_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-numeric/MultCommutative_false-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a7af5709195f6c1eec73f2559f8e654af4840835 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:50:49,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:50:49,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:50:49,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:50:49,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:50:49,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:50:49,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:50:49,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:50:49,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:50:49,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:50:49,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:50:49,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:50:49,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:50:49,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:50:49,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:50:49,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:50:49,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:50:49,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:50:49,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:50:49,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:50:49,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:50:49,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:50:49,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:50:49,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:50:49,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:50:49,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:50:49,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:50:49,394 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:50:49,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:50:49,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:50:49,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:50:49,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:50:49,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:50:49,398 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:50:49,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:50:49,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:50:49,400 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:50:49,416 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:50:49,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:50:49,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:50:49,419 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:50:49,419 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:50:49,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:50:49,419 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:50:49,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:50:49,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:50:49,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:50:49,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:50:49,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:50:49,421 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:50:49,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:50:49,421 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:50:49,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:50:49,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:50:49,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:50:49,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:50:49,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:50:49,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:50:49,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:50:49,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:50:49,424 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:50:49,425 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:50:49,425 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:50:49,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:50:49,425 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7af5709195f6c1eec73f2559f8e654af4840835 [2019-01-01 20:50:49,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:50:49,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:50:49,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:50:49,498 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:50:49,501 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:50:49,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/MultCommutative_false-no-overflow.c [2019-01-01 20:50:49,572 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9dfa3f2/4772f26d994a42c8ab43fc9b3e30b655/FLAGc7daf6e4b [2019-01-01 20:50:50,057 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:50:50,059 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/MultCommutative_false-no-overflow.c [2019-01-01 20:50:50,066 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9dfa3f2/4772f26d994a42c8ab43fc9b3e30b655/FLAGc7daf6e4b [2019-01-01 20:50:50,423 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9dfa3f2/4772f26d994a42c8ab43fc9b3e30b655 [2019-01-01 20:50:50,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:50:50,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:50:50,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:50:50,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:50:50,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:50:50,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0f8a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50, skipping insertion in model container [2019-01-01 20:50:50,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:50:50,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:50:50,649 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:50:50,654 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:50:50,674 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:50:50,689 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:50:50,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50 WrapperNode [2019-01-01 20:50:50,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:50:50,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:50:50,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:50:50,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:50:50,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:50:50,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:50:50,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:50:50,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:50:50,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (1/1) ... [2019-01-01 20:50:50,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:50:50,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:50:50,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:50:50,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:50:50,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (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-01-01 20:50:50,888 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-01-01 20:50:50,888 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-01-01 20:50:50,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:50:50,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:50:51,289 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:50:51,290 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:50:51,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:50:51 BoogieIcfgContainer [2019-01-01 20:50:51,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:50:51,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:50:51,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:50:51,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:50:51,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:50:50" (1/3) ... [2019-01-01 20:50:51,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676c3a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:50:51, skipping insertion in model container [2019-01-01 20:50:51,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:50:50" (2/3) ... [2019-01-01 20:50:51,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676c3a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:50:51, skipping insertion in model container [2019-01-01 20:50:51,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:50:51" (3/3) ... [2019-01-01 20:50:51,298 INFO L112 eAbstractionObserver]: Analyzing ICFG MultCommutative_false-no-overflow.c [2019-01-01 20:50:51,308 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:50:51,316 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 20:50:51,330 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 20:50:51,365 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:50:51,366 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:50:51,366 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:50:51,366 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:50:51,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:50:51,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:50:51,366 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:50:51,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:50:51,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:50:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-01-01 20:50:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:50:51,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:51,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:51,394 INFO L423 AbstractCegarLoop]: === Iteration 1 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash 887577448, now seen corresponding path program 1 times [2019-01-01 20:50:51,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:51,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:51,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:51,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:51,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:50:51,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:50:51,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:50:51,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:50:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:50:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:50:51,629 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-01-01 20:50:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:51,972 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2019-01-01 20:50:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:50:51,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-01 20:50:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:51,990 INFO L225 Difference]: With dead ends: 80 [2019-01-01 20:50:51,990 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 20:50:51,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:50:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 20:50:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2019-01-01 20:50:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 20:50:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-01-01 20:50:52,056 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 7 [2019-01-01 20:50:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:52,057 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-01-01 20:50:52,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:50:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-01-01 20:50:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 20:50:52,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:52,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:52,059 INFO L423 AbstractCegarLoop]: === Iteration 2 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1745104164, now seen corresponding path program 1 times [2019-01-01 20:50:52,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:52,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:52,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:52,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-01-01 20:50:52,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:50:52,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:50:52,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:50:52,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:50:52,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:50:52,145 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 5 states. [2019-01-01 20:50:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:52,383 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-01-01 20:50:52,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:50:52,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-01 20:50:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:52,386 INFO L225 Difference]: With dead ends: 58 [2019-01-01 20:50:52,386 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 20:50:52,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:50:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 20:50:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-01-01 20:50:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-01 20:50:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-01-01 20:50:52,398 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 8 [2019-01-01 20:50:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:52,399 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-01-01 20:50:52,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:50:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-01-01 20:50:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 20:50:52,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:52,400 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:52,400 INFO L423 AbstractCegarLoop]: === Iteration 3 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:52,401 INFO L82 PathProgramCache]: Analyzing trace with hash 80311672, now seen corresponding path program 1 times [2019-01-01 20:50:52,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:52,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:50:52,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:50:52,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:50:52,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:50:52,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:50:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:50:52,471 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 5 states. [2019-01-01 20:50:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:52,725 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-01-01 20:50:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:50:52,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-01 20:50:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:52,730 INFO L225 Difference]: With dead ends: 76 [2019-01-01 20:50:52,730 INFO L226 Difference]: Without dead ends: 75 [2019-01-01 20:50:52,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:50:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-01 20:50:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2019-01-01 20:50:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 20:50:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-01-01 20:50:52,754 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 13 [2019-01-01 20:50:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:52,755 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-01-01 20:50:52,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:50:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-01-01 20:50:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:50:52,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:52,756 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:52,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:52,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1248859076, now seen corresponding path program 1 times [2019-01-01 20:50:52,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:52,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:52,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:50:52,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:50:52,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:50:52,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:50:52,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:50:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:50:52,826 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 5 states. [2019-01-01 20:50:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:52,996 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2019-01-01 20:50:52,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:50:52,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-01 20:50:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:53,000 INFO L225 Difference]: With dead ends: 120 [2019-01-01 20:50:53,001 INFO L226 Difference]: Without dead ends: 84 [2019-01-01 20:50:53,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:50:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-01 20:50:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-01-01 20:50:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-01 20:50:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-01-01 20:50:53,017 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 14 [2019-01-01 20:50:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:53,017 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-01-01 20:50:53,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:50:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-01-01 20:50:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 20:50:53,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:53,018 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:53,019 INFO L423 AbstractCegarLoop]: === Iteration 5 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash 59932744, now seen corresponding path program 1 times [2019-01-01 20:50:53,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:53,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:53,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:53,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:53,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:50:53,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:50:53,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:50:53,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:50:53,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:50:53,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:50:53,287 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 5 states. [2019-01-01 20:50:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:53,539 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2019-01-01 20:50:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:50:53,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-01 20:50:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:53,541 INFO L225 Difference]: With dead ends: 101 [2019-01-01 20:50:53,541 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 20:50:53,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:50:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 20:50:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2019-01-01 20:50:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 20:50:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2019-01-01 20:50:53,557 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 15 [2019-01-01 20:50:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:53,557 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-01-01 20:50:53,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:50:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2019-01-01 20:50:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 20:50:53,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:53,559 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:53,559 INFO L423 AbstractCegarLoop]: === Iteration 6 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash 114054747, now seen corresponding path program 1 times [2019-01-01 20:50:53,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:53,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:53,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:50:53,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:50:53,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:50:53,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:50:53,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:50:53,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:50:53,647 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 5 states. [2019-01-01 20:50:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:53,801 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2019-01-01 20:50:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:50:53,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-01 20:50:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:53,803 INFO L225 Difference]: With dead ends: 132 [2019-01-01 20:50:53,803 INFO L226 Difference]: Without dead ends: 58 [2019-01-01 20:50:53,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:50:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-01 20:50:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-01-01 20:50:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 20:50:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-01-01 20:50:53,813 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 18 [2019-01-01 20:50:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:53,813 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-01-01 20:50:53,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:50:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-01-01 20:50:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:50:53,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:53,815 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:53,815 INFO L423 AbstractCegarLoop]: === Iteration 7 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash -65083495, now seen corresponding path program 1 times [2019-01-01 20:50:53,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:53,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:53,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:53,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:53,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:50:53,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:53,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:53,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:53,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:50:54,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:54,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 20:50:54,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:50:54,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:50:54,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:50:54,056 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 8 states. [2019-01-01 20:50:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:54,293 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2019-01-01 20:50:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:50:54,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-01 20:50:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:54,303 INFO L225 Difference]: With dead ends: 66 [2019-01-01 20:50:54,303 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 20:50:54,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:50:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 20:50:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-01-01 20:50:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 20:50:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-01-01 20:50:54,319 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 17 [2019-01-01 20:50:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:54,319 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-01 20:50:54,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:50:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-01-01 20:50:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 20:50:54,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:54,320 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:54,321 INFO L423 AbstractCegarLoop]: === Iteration 8 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2017588291, now seen corresponding path program 1 times [2019-01-01 20:50:54,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:54,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:54,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:50:54,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:54,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:54,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:54,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:50:54,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:54,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 20:50:54,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:50:54,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:50:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:50:54,544 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 7 states. [2019-01-01 20:50:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:54,716 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-01-01 20:50:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:50:54,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-01 20:50:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:54,718 INFO L225 Difference]: With dead ends: 58 [2019-01-01 20:50:54,718 INFO L226 Difference]: Without dead ends: 57 [2019-01-01 20:50:54,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:50:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-01 20:50:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-01 20:50:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 20:50:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-01-01 20:50:54,726 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 18 [2019-01-01 20:50:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:54,727 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-01-01 20:50:54,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:50:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-01-01 20:50:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 20:50:54,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:54,728 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:54,729 INFO L423 AbstractCegarLoop]: === Iteration 9 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1437475595, now seen corresponding path program 1 times [2019-01-01 20:50:54,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:54,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:54,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:54,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:54,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 20:50:54,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:54,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:54,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:54,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:50:55,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:55,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2019-01-01 20:50:55,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:50:55,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:50:55,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:50:55,051 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 13 states. [2019-01-01 20:50:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:55,530 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2019-01-01 20:50:55,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:50:55,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-01 20:50:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:55,532 INFO L225 Difference]: With dead ends: 93 [2019-01-01 20:50:55,532 INFO L226 Difference]: Without dead ends: 92 [2019-01-01 20:50:55,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:50:55,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-01 20:50:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-01-01 20:50:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-01 20:50:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-01-01 20:50:55,546 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 24 [2019-01-01 20:50:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:55,546 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-01-01 20:50:55,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:50:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-01-01 20:50:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:50:55,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:55,548 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:55,549 INFO L423 AbstractCegarLoop]: === Iteration 10 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1612070431, now seen corresponding path program 1 times [2019-01-01 20:50:55,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:55,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 20:50:55,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:55,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:55,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:55,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 20:50:55,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:55,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 20:50:55,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:50:55,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:50:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:50:55,773 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 7 states. [2019-01-01 20:50:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:55,824 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-01-01 20:50:55,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:50:55,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-01 20:50:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:55,827 INFO L225 Difference]: With dead ends: 84 [2019-01-01 20:50:55,828 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 20:50:55,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:50:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 20:50:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-01 20:50:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 20:50:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2019-01-01 20:50:55,835 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 25 [2019-01-01 20:50:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:55,835 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2019-01-01 20:50:55,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:50:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2019-01-01 20:50:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 20:50:55,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:55,837 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:50:55,837 INFO L423 AbstractCegarLoop]: === Iteration 11 === [multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash 935767789, now seen corresponding path program 1 times [2019-01-01 20:50:55,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:55,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:55,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:55,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:55,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:50:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:50:55,880 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 20:50:55,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:50:55 BoogieIcfgContainer [2019-01-01 20:50:55,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:50:55,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:50:55,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:50:55,914 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:50:55,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:50:51" (3/4) ... [2019-01-01 20:50:55,917 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 20:50:55,982 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:50:55,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:50:55,984 INFO L168 Benchmark]: Toolchain (without parser) took 5555.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.4 MB in the beginning and 854.7 MB in the end (delta: 96.6 MB). Peak memory consumption was 242.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:50:55,986 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:50:55,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.26 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:50:55,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.16 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:50:55,994 INFO L168 Benchmark]: Boogie Preprocessor took 30.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:50:55,994 INFO L168 Benchmark]: RCFGBuilder took 522.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:50:55,995 INFO L168 Benchmark]: TraceAbstraction took 4622.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 854.7 MB in the end (delta: 267.1 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:50:55,995 INFO L168 Benchmark]: Witness Printer took 69.29 ms. Allocated memory is still 1.2 GB. Free memory is still 854.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:50:56,001 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.26 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.16 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 522.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4622.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 854.7 MB in the end (delta: 267.1 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. * Witness Printer took 69.29 ms. Allocated memory is still 1.2 GB. Free memory is still 854.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) [L34] CALL mult(m, n) VAL [\old(m)=2, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=2147483647, m=0, n=2147483647] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=2147483647, \result=0, m=0, n=2147483647] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=2147483647, m=1, mult(n, m - 1)=0, n=2147483647] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647, m=2, mult(n, m - 1)=2147483647, n=2147483647] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647, m=2, mult(n, m - 1)=2147483647, n=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 6 error locations. UNSAFE Result, 4.5s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 341 SDslu, 530 SDs, 0 SdLazy, 539 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 10327 SizeOfPredicates, 5 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 40/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...