./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f 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-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:16:59,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:16:59,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:16:59,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:16:59,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:16:59,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:16:59,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:16:59,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:16:59,926 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:16:59,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:16:59,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:16:59,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:16:59,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:16:59,937 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:16:59,938 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:16:59,939 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:16:59,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:16:59,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:16:59,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:16:59,952 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:16:59,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:16:59,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:16:59,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:16:59,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:16:59,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:16:59,964 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:16:59,965 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:16:59,966 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:16:59,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:16:59,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:16:59,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:16:59,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:16:59,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:16:59,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:16:59,976 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:16:59,977 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:16:59,977 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:17:00,010 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:17:00,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:17:00,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:17:00,012 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:17:00,012 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:17:00,014 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:17:00,014 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:17:00,014 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:17:00,014 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:17:00,014 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:17:00,015 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:17:00,015 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:17:00,015 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:17:00,015 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:17:00,015 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:17:00,015 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:17:00,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:17:00,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:17:00,017 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:17:00,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:17:00,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:17:00,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:17:00,018 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:17:00,018 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:17:00,018 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:17:00,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:17:00,019 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:17:00,019 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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-01-14 01:17:00,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:17:00,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:17:00,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:17:00,093 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:17:00,093 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:17:00,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:17:00,149 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0d22632/e55fd6be15aa450e9b506bbe858da0cb/FLAG114d5d063 [2019-01-14 01:17:00,587 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:17:00,587 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:17:00,593 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0d22632/e55fd6be15aa450e9b506bbe858da0cb/FLAG114d5d063 [2019-01-14 01:17:00,969 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0d22632/e55fd6be15aa450e9b506bbe858da0cb [2019-01-14 01:17:00,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:17:00,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:17:00,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:17:00,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:17:00,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:17:00,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:17:00" (1/1) ... [2019-01-14 01:17:00,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611e71fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:00, skipping insertion in model container [2019-01-14 01:17:00,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:17:00" (1/1) ... [2019-01-14 01:17:00,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:17:01,015 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:17:01,259 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:17:01,264 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:17:01,286 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:17:01,307 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:17:01,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01 WrapperNode [2019-01-14 01:17:01,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:17:01,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:17:01,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:17:01,309 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:17:01,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:17:01,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:17:01,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:17:01,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:17:01,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (1/1) ... [2019-01-14 01:17:01,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:17:01,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:17:01,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:17:01,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:17:01,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (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-14 01:17:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-01-14 01:17:01,521 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-01-14 01:17:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-01-14 01:17:01,521 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-01-14 01:17:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:17:01,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:17:01,941 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:17:01,942 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:17:01,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:01 BoogieIcfgContainer [2019-01-14 01:17:01,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:17:01,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:17:01,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:17:01,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:17:01,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:17:00" (1/3) ... [2019-01-14 01:17:01,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380c9f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:17:01, skipping insertion in model container [2019-01-14 01:17:01,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:01" (2/3) ... [2019-01-14 01:17:01,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380c9f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:17:01, skipping insertion in model container [2019-01-14 01:17:01,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:01" (3/3) ... [2019-01-14 01:17:01,951 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:17:01,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:17:01,967 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-14 01:17:01,979 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-14 01:17:02,011 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:17:02,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:17:02,012 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:17:02,013 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:17:02,013 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:17:02,013 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:17:02,013 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:17:02,013 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:17:02,013 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:17:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-01-14 01:17:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:17:02,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:02,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:02,042 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:02,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:02,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-01-14 01:17:02,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:02,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:02,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:02,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:02,327 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-14 01:17:02,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:02,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:17:02,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:17:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:17:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:17:02,347 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2019-01-14 01:17:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:02,881 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-01-14 01:17:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:02,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-14 01:17:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:02,894 INFO L225 Difference]: With dead ends: 86 [2019-01-14 01:17:02,894 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 01:17:02,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:17:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 01:17:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-01-14 01:17:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 01:17:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-01-14 01:17:02,947 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-01-14 01:17:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:02,947 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-01-14 01:17:02,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:17:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-01-14 01:17:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 01:17:02,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:02,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:02,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:02,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:02,950 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-01-14 01:17:02,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:02,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:02,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:02,985 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-14 01:17:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:02,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:17:02,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:17:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:17:02,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:17:02,988 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-01-14 01:17:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:03,027 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-01-14 01:17:03,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:17:03,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 01:17:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:03,030 INFO L225 Difference]: With dead ends: 70 [2019-01-14 01:17:03,030 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 01:17:03,033 INFO L631 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-01-14 01:17:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 01:17:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-01-14 01:17:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 01:17:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-01-14 01:17:03,051 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-01-14 01:17:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:03,052 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-01-14 01:17:03,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:17:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-01-14 01:17:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 01:17:03,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:03,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:03,054 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:03,054 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-01-14 01:17:03,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:03,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:03,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:03,085 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-14 01:17:03,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:03,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:17:03,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:17:03,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:17:03,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:17:03,087 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-01-14 01:17:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:03,129 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-01-14 01:17:03,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:17:03,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 01:17:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:03,133 INFO L225 Difference]: With dead ends: 65 [2019-01-14 01:17:03,133 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 01:17:03,134 INFO L631 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-01-14 01:17:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 01:17:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-14 01:17:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 01:17:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-01-14 01:17:03,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-01-14 01:17:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:03,145 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-01-14 01:17:03,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:17:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-01-14 01:17:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:17:03,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:03,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:03,147 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-01-14 01:17:03,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:03,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:03,198 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-14 01:17:03,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:03,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:03,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:17:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:17:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:03,201 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-01-14 01:17:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:03,254 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-01-14 01:17:03,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:17:03,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 01:17:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:03,256 INFO L225 Difference]: With dead ends: 85 [2019-01-14 01:17:03,256 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 01:17:03,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 01:17:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-01-14 01:17:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 01:17:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-01-14 01:17:03,271 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-01-14 01:17:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:03,271 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-01-14 01:17:03,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:17:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-01-14 01:17:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 01:17:03,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:03,273 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:03,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:03,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-01-14 01:17:03,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:03,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:03,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:03,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:03,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:03,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:17:03,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:17:03,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:17:03,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:17:03,340 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-01-14 01:17:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:03,399 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-01-14 01:17:03,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:17:03,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 01:17:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:03,405 INFO L225 Difference]: With dead ends: 74 [2019-01-14 01:17:03,405 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 01:17:03,408 INFO L631 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-01-14 01:17:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 01:17:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-14 01:17:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 01:17:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-01-14 01:17:03,420 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-01-14 01:17:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:03,422 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-01-14 01:17:03,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:17:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-01-14 01:17:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:17:03,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:03,423 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:03,427 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-01-14 01:17:03,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:03,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:03,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:03,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:03,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:03,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:03,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:17:03,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:17:03,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:03,500 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-01-14 01:17:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:03,547 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-01-14 01:17:03,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:17:03,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-14 01:17:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:03,553 INFO L225 Difference]: With dead ends: 94 [2019-01-14 01:17:03,553 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 01:17:03,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 01:17:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-01-14 01:17:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 01:17:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-01-14 01:17:03,586 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-01-14 01:17:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:03,587 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-01-14 01:17:03,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:17:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-01-14 01:17:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:17:03,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:03,588 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:03,589 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:03,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-01-14 01:17:03,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:03,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:03,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:17:03,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:03,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:03,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:03,660 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2019-01-14 01:17:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:03,790 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-01-14 01:17:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:17:03,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-14 01:17:03,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:03,794 INFO L225 Difference]: With dead ends: 125 [2019-01-14 01:17:03,794 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 01:17:03,795 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-14 01:17:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 01:17:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-14 01:17:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 01:17:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-01-14 01:17:03,808 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-01-14 01:17:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:03,808 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-01-14 01:17:03,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-01-14 01:17:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 01:17:03,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:03,810 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:03,810 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:03,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-01-14 01:17:03,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:03,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:03,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:03,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:17:03,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:03,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:03,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:03,896 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 5 states. [2019-01-14 01:17:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:04,302 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2019-01-14 01:17:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:17:04,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 01:17:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:04,305 INFO L225 Difference]: With dead ends: 98 [2019-01-14 01:17:04,305 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 01:17:04,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:17:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 01:17:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2019-01-14 01:17:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 01:17:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2019-01-14 01:17:04,330 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 21 [2019-01-14 01:17:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:04,331 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2019-01-14 01:17:04,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2019-01-14 01:17:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 01:17:04,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:04,333 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:04,334 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:04,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:04,334 INFO L82 PathProgramCache]: Analyzing trace with hash 105489077, now seen corresponding path program 1 times [2019-01-14 01:17:04,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:04,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:04,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:04,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:04,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:04,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:17:04,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:04,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:04,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:04,425 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand 5 states. [2019-01-14 01:17:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:04,594 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2019-01-14 01:17:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:17:04,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-14 01:17:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:04,598 INFO L225 Difference]: With dead ends: 119 [2019-01-14 01:17:04,598 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 01:17:04,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:17:04,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 01:17:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2019-01-14 01:17:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 01:17:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2019-01-14 01:17:04,612 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 32 [2019-01-14 01:17:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:04,612 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2019-01-14 01:17:04,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2019-01-14 01:17:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 01:17:04,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:04,615 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:04,616 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash 952008726, now seen corresponding path program 1 times [2019-01-14 01:17:04,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:04,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:04,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:04,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 01:17:04,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:04,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:04,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:17:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:17:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:04,675 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand 4 states. [2019-01-14 01:17:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:04,703 INFO L93 Difference]: Finished difference Result 128 states and 170 transitions. [2019-01-14 01:17:04,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:17:04,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-01-14 01:17:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:04,718 INFO L225 Difference]: With dead ends: 128 [2019-01-14 01:17:04,718 INFO L226 Difference]: Without dead ends: 127 [2019-01-14 01:17:04,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-14 01:17:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-01-14 01:17:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-14 01:17:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2019-01-14 01:17:04,734 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 30 [2019-01-14 01:17:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:04,741 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2019-01-14 01:17:04,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:17:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2019-01-14 01:17:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 01:17:04,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:04,743 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:04,743 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:04,747 INFO L82 PathProgramCache]: Analyzing trace with hash -552500514, now seen corresponding path program 1 times [2019-01-14 01:17:04,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:04,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:04,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:04,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:04,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 01:17:04,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:04,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:17:04,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:17:04,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:17:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:17:04,848 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand 3 states. [2019-01-14 01:17:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:04,909 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2019-01-14 01:17:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:17:04,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-14 01:17:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:04,916 INFO L225 Difference]: With dead ends: 123 [2019-01-14 01:17:04,916 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 01:17:04,917 INFO L631 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-01-14 01:17:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 01:17:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-01-14 01:17:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 01:17:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2019-01-14 01:17:04,938 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 31 [2019-01-14 01:17:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:04,941 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-01-14 01:17:04,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:17:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2019-01-14 01:17:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 01:17:04,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:04,943 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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-01-14 01:17:04,948 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:04,948 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-01-14 01:17:04,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:04,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:04,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:04,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:04,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 01:17:05,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:05,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:17:05,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:05,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:05,109 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand 5 states. [2019-01-14 01:17:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:05,362 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2019-01-14 01:17:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:17:05,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-14 01:17:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:05,365 INFO L225 Difference]: With dead ends: 122 [2019-01-14 01:17:05,366 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 01:17:05,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 01:17:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-14 01:17:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 01:17:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2019-01-14 01:17:05,380 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 36 [2019-01-14 01:17:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:05,381 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2019-01-14 01:17:05,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2019-01-14 01:17:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 01:17:05,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:05,385 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:05,386 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1564104406, now seen corresponding path program 1 times [2019-01-14 01:17:05,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 01:17:05,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:05,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:17:05,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:05,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:05,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:05,516 INFO L87 Difference]: Start difference. First operand 121 states and 152 transitions. Second operand 5 states. [2019-01-14 01:17:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:05,626 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2019-01-14 01:17:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:17:05,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-01-14 01:17:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:05,628 INFO L225 Difference]: With dead ends: 121 [2019-01-14 01:17:05,628 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 01:17:05,628 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-14 01:17:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 01:17:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2019-01-14 01:17:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 01:17:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2019-01-14 01:17:05,645 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 41 [2019-01-14 01:17:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:05,645 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2019-01-14 01:17:05,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2019-01-14 01:17:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 01:17:05,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:05,649 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:05,650 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-01-14 01:17:05,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 01:17:05,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:05,806 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-14 01:17:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:05,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 01:17:05,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:05,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:17:05,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:17:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:17:05,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:17:05,915 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand 8 states. [2019-01-14 01:17:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:06,270 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2019-01-14 01:17:06,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:06,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-01-14 01:17:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:06,276 INFO L225 Difference]: With dead ends: 219 [2019-01-14 01:17:06,276 INFO L226 Difference]: Without dead ends: 142 [2019-01-14 01:17:06,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:17:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-14 01:17:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2019-01-14 01:17:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-14 01:17:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2019-01-14 01:17:06,293 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 43 [2019-01-14 01:17:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:06,293 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2019-01-14 01:17:06,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:17:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2019-01-14 01:17:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 01:17:06,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:06,294 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 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, 1, 1, 1, 1] [2019-01-14 01:17:06,297 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2019-01-14 01:17:06,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:06,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 01:17:06,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:06,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:17:06,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:17:06,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:17:06,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:17:06,339 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 3 states. [2019-01-14 01:17:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:06,385 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2019-01-14 01:17:06,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:17:06,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-14 01:17:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:06,387 INFO L225 Difference]: With dead ends: 124 [2019-01-14 01:17:06,387 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 01:17:06,388 INFO L631 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-01-14 01:17:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 01:17:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-14 01:17:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-14 01:17:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-01-14 01:17:06,398 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 43 [2019-01-14 01:17:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:06,398 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-01-14 01:17:06,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:17:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-01-14 01:17:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 01:17:06,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:06,400 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 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, 1, 1, 1, 1, 1] [2019-01-14 01:17:06,400 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2019-01-14 01:17:06,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:06,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 01:17:06,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:06,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:06,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:17:06,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:17:06,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:06,538 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 4 states. [2019-01-14 01:17:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:06,687 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2019-01-14 01:17:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:17:06,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-14 01:17:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:06,690 INFO L225 Difference]: With dead ends: 132 [2019-01-14 01:17:06,691 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 01:17:06,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 01:17:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-14 01:17:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 01:17:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2019-01-14 01:17:06,702 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 44 [2019-01-14 01:17:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:06,704 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2019-01-14 01:17:06,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:17:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2019-01-14 01:17:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 01:17:06,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:06,707 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:06,708 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1484024119, now seen corresponding path program 1 times [2019-01-14 01:17:06,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:06,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-14 01:17:07,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:07,084 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-14 01:17:07,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-14 01:17:07,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:07,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:17:07,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:17:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:17:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:07,167 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 6 states. [2019-01-14 01:17:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:07,473 INFO L93 Difference]: Finished difference Result 258 states and 337 transitions. [2019-01-14 01:17:07,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:17:07,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-01-14 01:17:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:07,476 INFO L225 Difference]: With dead ends: 258 [2019-01-14 01:17:07,476 INFO L226 Difference]: Without dead ends: 146 [2019-01-14 01:17:07,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:17:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-14 01:17:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2019-01-14 01:17:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 01:17:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-01-14 01:17:07,498 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 59 [2019-01-14 01:17:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:07,500 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-01-14 01:17:07,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:17:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-01-14 01:17:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-14 01:17:07,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:07,505 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:07,505 INFO L423 AbstractCegarLoop]: === Iteration 18 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:07,507 INFO L82 PathProgramCache]: Analyzing trace with hash 908258825, now seen corresponding path program 2 times [2019-01-14 01:17:07,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:07,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:07,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:07,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 23 proven. 86 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-01-14 01:17:07,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:07,803 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-14 01:17:07,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:17:07,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:17:07,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:07,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 231 proven. 15 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-14 01:17:07,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:07,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:17:07,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:17:07,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:17:07,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:07,930 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 6 states. [2019-01-14 01:17:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:08,153 INFO L93 Difference]: Finished difference Result 292 states and 387 transitions. [2019-01-14 01:17:08,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:17:08,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-01-14 01:17:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:08,157 INFO L225 Difference]: With dead ends: 292 [2019-01-14 01:17:08,158 INFO L226 Difference]: Without dead ends: 170 [2019-01-14 01:17:08,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:17:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-14 01:17:08,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2019-01-14 01:17:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-14 01:17:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2019-01-14 01:17:08,179 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 107 [2019-01-14 01:17:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:08,180 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2019-01-14 01:17:08,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:17:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2019-01-14 01:17:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-14 01:17:08,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:08,182 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:08,184 INFO L423 AbstractCegarLoop]: === Iteration 19 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:08,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1623555139, now seen corresponding path program 3 times [2019-01-14 01:17:08,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:08,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:08,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:08,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-01-14 01:17:08,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:08,610 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-14 01:17:08,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:17:08,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 01:17:08,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:08,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2019-01-14 01:17:08,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:08,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2019-01-14 01:17:08,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:17:08,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:17:08,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:17:08,830 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand 9 states. [2019-01-14 01:17:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:09,063 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2019-01-14 01:17:09,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:17:09,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2019-01-14 01:17:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:09,067 INFO L225 Difference]: With dead ends: 205 [2019-01-14 01:17:09,067 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:17:09,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:17:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:17:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:17:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:17:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:17:09,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2019-01-14 01:17:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:09,071 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:17:09,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:17:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:17:09,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:17:09,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:17:09,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:09,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:09,832 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-01-14 01:17:10,091 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-01-14 01:17:10,387 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2019-01-14 01:17:10,390 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-01-14 01:17:10,390 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-01-14 01:17:10,390 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,391 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,391 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,391 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-01-14 01:17:10,391 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,391 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-01-14 01:17:10,392 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= |rec1_#in~i| rec1_~i) (<= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2019-01-14 01:17:10,392 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,392 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,392 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,392 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,393 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,393 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (or (and (<= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i)) (< 2147483646 |rec1_#in~i|)) (or (and (<= |rec1_#in~i| rec1_~i) (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i 2147483647) (<= |rec1_#t~ret0| 1)) (< 2147483647 |rec1_#in~i|))) [2019-01-14 01:17:10,393 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,393 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (or (and (<= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i)) (< 2147483646 |rec1_#in~i|)) (or (< 2147483647 |rec1_#in~i|) (and (<= |rec1_#in~i| rec1_~i) (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= |rec1_#t~ret1| 0) (<= rec1_~i 2147483647) (<= |rec1_#t~ret0| 1)))) [2019-01-14 01:17:10,393 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,393 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,393 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,394 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,394 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-01-14 01:17:10,394 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-01-14 01:17:10,394 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,394 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,394 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-01-14 01:17:10,394 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (< 0 |rec2_#in~j|) (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|))) [2019-01-14 01:17:10,394 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,394 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-01-14 01:17:10,395 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,395 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,395 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 0 (+ |rec2_#t~ret3| 2147483647)) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (< 0 |rec2_#in~j|)) [2019-01-14 01:17:10,395 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,395 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,395 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,395 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,395 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-14 01:17:10,395 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-01-14 01:17:10,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:17:10,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:17:10,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:17:10,396 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-14 01:17:10,396 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-01-14 01:17:10,396 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-01-14 01:17:10,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:17:10 BoogieIcfgContainer [2019-01-14 01:17:10,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:17:10,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:17:10,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:17:10,400 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:17:10,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:01" (3/4) ... [2019-01-14 01:17:10,404 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:17:10,411 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-01-14 01:17:10,411 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-01-14 01:17:10,416 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 01:17:10,417 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:17:10,471 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:17:10,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:17:10,473 INFO L168 Benchmark]: Toolchain (without parser) took 9498.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 952.7 MB in the beginning and 995.1 MB in the end (delta: -42.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:10,474 INFO L168 Benchmark]: CDTParser took 0.15 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-14 01:17:10,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.59 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:10,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.80 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:10,476 INFO L168 Benchmark]: Boogie Preprocessor took 24.08 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:10,476 INFO L168 Benchmark]: RCFGBuilder took 571.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:10,477 INFO L168 Benchmark]: TraceAbstraction took 8455.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 123.6 MB). Peak memory consumption was 178.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:10,480 INFO L168 Benchmark]: Witness Printer took 71.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 995.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:10,484 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.15 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 331.59 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 37.80 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.08 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 571.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8455.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 123.6 MB). Peak memory consumption was 178.7 MB. Max. memory is 11.5 GB. * Witness Printer took 71.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 995.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. SAFE Result, 8.3s OverallTime, 19 OverallIterations, 14 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 708 SDtfs, 294 SDslu, 1501 SDs, 0 SdLazy, 589 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=18, 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.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 121 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 339 PreInvPairs, 379 NumberOfFragments, 131 HoareAnnotationTreeSize, 339 FomulaSimplifications, 1817 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 163 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 917 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 979 ConstructedInterpolants, 0 QuantifiedInterpolants, 92963 SizeOfPredicates, 5 NumberOfNonLiveVariables, 487 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 1839/2051 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...