./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94419cb5ed7b14b2ed497048686126b88cc40ca2 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:54:44,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:54:44,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:54:44,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:54:44,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:54:44,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:54:44,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:54:44,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:54:44,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:54:44,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:54:44,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:54:44,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:54:44,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:54:44,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:54:44,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:54:44,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:54:44,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:54:44,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:54:44,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:54:44,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:54:44,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:54:44,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:54:44,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:54:44,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:54:44,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:54:44,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:54:44,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:54:44,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:54:44,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:54:44,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:54:44,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:54:44,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:54:44,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:54:44,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:54:44,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:54:44,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:54:44,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:54:44,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:54:44,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:54:44,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:54:44,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:54:44,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 02:54:44,942 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:54:44,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:54:44,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:54:44,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:54:44,945 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:54:44,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:54:44,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:54:44,946 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:54:44,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:54:44,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:54:44,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:54:44,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:54:44,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:54:44,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:54:44,949 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:54:44,949 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:54:44,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:54:44,950 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:54:44,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:54:44,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:54:44,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:54:44,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:54:44,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:54:44,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:54:44,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:54:44,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:54:44,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:54:44,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:54:44,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:54:44,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:54:44,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94419cb5ed7b14b2ed497048686126b88cc40ca2 [2019-11-28 02:54:45,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:54:45,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:54:45,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:54:45,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:54:45,345 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:54:45,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2019-11-28 02:54:45,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2429bce59/23ee0d0eda10411c8814455152461b7c/FLAGfa189fa1c [2019-11-28 02:54:45,870 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:54:45,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2019-11-28 02:54:45,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2429bce59/23ee0d0eda10411c8814455152461b7c/FLAGfa189fa1c [2019-11-28 02:54:46,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2429bce59/23ee0d0eda10411c8814455152461b7c [2019-11-28 02:54:46,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:54:46,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:54:46,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:54:46,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:54:46,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:54:46,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b09392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46, skipping insertion in model container [2019-11-28 02:54:46,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:54:46,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:54:46,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:54:46,752 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:54:46,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:54:46,874 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:54:46,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46 WrapperNode [2019-11-28 02:54:46,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:54:46,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:54:46,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:54:46,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:54:46,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:54:46,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:54:46,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:54:46,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:54:46,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... [2019-11-28 02:54:46,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:54:46,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:54:46,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:54:46,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:54:46,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:54:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:54:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:54:47,667 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:54:47,667 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-28 02:54:47,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:47 BoogieIcfgContainer [2019-11-28 02:54:47,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:54:47,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:54:47,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:54:47,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:54:47,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:54:46" (1/3) ... [2019-11-28 02:54:47,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537ff6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:54:47, skipping insertion in model container [2019-11-28 02:54:47,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:46" (2/3) ... [2019-11-28 02:54:47,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537ff6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:54:47, skipping insertion in model container [2019-11-28 02:54:47,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:47" (3/3) ... [2019-11-28 02:54:47,680 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2019-11-28 02:54:47,690 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:54:47,698 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-11-28 02:54:47,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-11-28 02:54:47,741 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:54:47,742 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:54:47,742 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:54:47,742 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:54:47,742 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:54:47,743 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:54:47,743 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:54:47,743 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:54:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-28 02:54:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:54:47,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:47,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:54:47,794 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-11-28 02:54:47,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:47,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004385274] [2019-11-28 02:54:47,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:47,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004385274] [2019-11-28 02:54:47,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:47,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:47,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562683035] [2019-11-28 02:54:47,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 02:54:47,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 02:54:47,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 02:54:47,959 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 2 states. [2019-11-28 02:54:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:47,994 INFO L93 Difference]: Finished difference Result 271 states and 357 transitions. [2019-11-28 02:54:47,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 02:54:47,996 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-28 02:54:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:48,008 INFO L225 Difference]: With dead ends: 271 [2019-11-28 02:54:48,008 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 02:54:48,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 02:54:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 02:54:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-11-28 02:54:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 02:54:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2019-11-28 02:54:48,091 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 6 [2019-11-28 02:54:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:48,092 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2019-11-28 02:54:48,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 02:54:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2019-11-28 02:54:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:54:48,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:48,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:54:48,097 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:48,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-11-28 02:54:48,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:48,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000500750] [2019-11-28 02:54:48,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:48,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000500750] [2019-11-28 02:54:48,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:48,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:48,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106610017] [2019-11-28 02:54:48,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:48,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:48,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:48,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:48,166 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 4 states. [2019-11-28 02:54:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:48,364 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2019-11-28 02:54:48,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:48,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-28 02:54:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:48,369 INFO L225 Difference]: With dead ends: 290 [2019-11-28 02:54:48,370 INFO L226 Difference]: Without dead ends: 166 [2019-11-28 02:54:48,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-28 02:54:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 106. [2019-11-28 02:54:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 02:54:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-11-28 02:54:48,382 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 6 [2019-11-28 02:54:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:48,383 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-11-28 02:54:48,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-11-28 02:54:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:54:48,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:48,384 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:48,384 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-11-28 02:54:48,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:48,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944462055] [2019-11-28 02:54:48,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:48,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944462055] [2019-11-28 02:54:48,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:48,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:48,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294351005] [2019-11-28 02:54:48,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:48,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:48,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:48,448 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 4 states. [2019-11-28 02:54:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:48,537 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2019-11-28 02:54:48,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:48,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 02:54:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:48,540 INFO L225 Difference]: With dead ends: 173 [2019-11-28 02:54:48,540 INFO L226 Difference]: Without dead ends: 169 [2019-11-28 02:54:48,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-28 02:54:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 107. [2019-11-28 02:54:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 02:54:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-11-28 02:54:48,554 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 9 [2019-11-28 02:54:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:48,554 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-11-28 02:54:48,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2019-11-28 02:54:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:54:48,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:48,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:48,556 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:48,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-11-28 02:54:48,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:48,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548034383] [2019-11-28 02:54:48,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:48,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548034383] [2019-11-28 02:54:48,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:48,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:48,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035850200] [2019-11-28 02:54:48,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:48,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:48,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:48,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:48,591 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand 3 states. [2019-11-28 02:54:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:48,656 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2019-11-28 02:54:48,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:48,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 02:54:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:48,658 INFO L225 Difference]: With dead ends: 167 [2019-11-28 02:54:48,658 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 02:54:48,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 02:54:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 105. [2019-11-28 02:54:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 02:54:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-28 02:54:48,670 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 10 [2019-11-28 02:54:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:48,670 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-28 02:54:48,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-11-28 02:54:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:54:48,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:48,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:48,672 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:48,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-11-28 02:54:48,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:48,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845688290] [2019-11-28 02:54:48,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:48,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845688290] [2019-11-28 02:54:48,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:48,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:48,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674867416] [2019-11-28 02:54:48,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:48,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:48,731 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 4 states. [2019-11-28 02:54:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:48,811 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2019-11-28 02:54:48,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:48,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:54:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:48,813 INFO L225 Difference]: With dead ends: 171 [2019-11-28 02:54:48,813 INFO L226 Difference]: Without dead ends: 169 [2019-11-28 02:54:48,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:48,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-28 02:54:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 107. [2019-11-28 02:54:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 02:54:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-11-28 02:54:48,825 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 11 [2019-11-28 02:54:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:48,825 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-11-28 02:54:48,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2019-11-28 02:54:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:54:48,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:48,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:48,828 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:48,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:48,828 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-11-28 02:54:48,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:48,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522931501] [2019-11-28 02:54:48,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:48,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522931501] [2019-11-28 02:54:48,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:48,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:48,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849762364] [2019-11-28 02:54:48,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:48,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:48,897 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand 4 states. [2019-11-28 02:54:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:48,976 INFO L93 Difference]: Finished difference Result 174 states and 202 transitions. [2019-11-28 02:54:48,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:48,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:54:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:48,979 INFO L225 Difference]: With dead ends: 174 [2019-11-28 02:54:48,980 INFO L226 Difference]: Without dead ends: 172 [2019-11-28 02:54:48,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-28 02:54:49,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 110. [2019-11-28 02:54:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 02:54:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2019-11-28 02:54:49,003 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 12 [2019-11-28 02:54:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:49,004 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2019-11-28 02:54:49,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2019-11-28 02:54:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:54:49,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:49,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:49,011 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:49,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:49,014 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-11-28 02:54:49,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:49,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809126874] [2019-11-28 02:54:49,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:49,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-11-28 02:54:49,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809126874] [2019-11-28 02:54:49,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:49,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:49,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097577452] [2019-11-28 02:54:49,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:49,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:49,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:49,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:49,088 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand 4 states. [2019-11-28 02:54:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:49,194 INFO L93 Difference]: Finished difference Result 238 states and 272 transitions. [2019-11-28 02:54:49,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:49,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 02:54:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:49,196 INFO L225 Difference]: With dead ends: 238 [2019-11-28 02:54:49,197 INFO L226 Difference]: Without dead ends: 236 [2019-11-28 02:54:49,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-28 02:54:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 109. [2019-11-28 02:54:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 02:54:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2019-11-28 02:54:49,208 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 14 [2019-11-28 02:54:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:49,208 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2019-11-28 02:54:49,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2019-11-28 02:54:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:54:49,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:49,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:49,216 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1259484934, now seen corresponding path program 1 times [2019-11-28 02:54:49,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:49,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143358289] [2019-11-28 02:54:49,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:49,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143358289] [2019-11-28 02:54:49,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:49,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:49,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137274510] [2019-11-28 02:54:49,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:49,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:49,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:49,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:49,439 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand 8 states. [2019-11-28 02:54:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:49,835 INFO L93 Difference]: Finished difference Result 267 states and 313 transitions. [2019-11-28 02:54:49,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:54:49,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-28 02:54:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:49,838 INFO L225 Difference]: With dead ends: 267 [2019-11-28 02:54:49,838 INFO L226 Difference]: Without dead ends: 197 [2019-11-28 02:54:49,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:54:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-28 02:54:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 158. [2019-11-28 02:54:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 02:54:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2019-11-28 02:54:49,853 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 14 [2019-11-28 02:54:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:49,853 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2019-11-28 02:54:49,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2019-11-28 02:54:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:54:49,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:49,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:49,856 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:49,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:49,856 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-11-28 02:54:49,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:49,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014352095] [2019-11-28 02:54:49,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:49,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014352095] [2019-11-28 02:54:49,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:49,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:49,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182781705] [2019-11-28 02:54:49,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:49,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:49,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:49,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:49,929 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand 4 states. [2019-11-28 02:54:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:50,003 INFO L93 Difference]: Finished difference Result 247 states and 296 transitions. [2019-11-28 02:54:50,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:50,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 02:54:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:50,006 INFO L225 Difference]: With dead ends: 247 [2019-11-28 02:54:50,007 INFO L226 Difference]: Without dead ends: 245 [2019-11-28 02:54:50,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-28 02:54:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 150. [2019-11-28 02:54:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 02:54:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2019-11-28 02:54:50,020 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 183 transitions. Word has length 14 [2019-11-28 02:54:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:50,020 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 183 transitions. [2019-11-28 02:54:50,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2019-11-28 02:54:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:54:50,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:50,024 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:50,024 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:50,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-11-28 02:54:50,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:50,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875590810] [2019-11-28 02:54:50,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:50,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875590810] [2019-11-28 02:54:50,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:50,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:50,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779787274] [2019-11-28 02:54:50,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:50,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:50,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:50,081 INFO L87 Difference]: Start difference. First operand 150 states and 183 transitions. Second operand 4 states. [2019-11-28 02:54:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:50,156 INFO L93 Difference]: Finished difference Result 272 states and 322 transitions. [2019-11-28 02:54:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:50,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:54:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:50,159 INFO L225 Difference]: With dead ends: 272 [2019-11-28 02:54:50,159 INFO L226 Difference]: Without dead ends: 270 [2019-11-28 02:54:50,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-28 02:54:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 136. [2019-11-28 02:54:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 02:54:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2019-11-28 02:54:50,177 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 15 [2019-11-28 02:54:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:50,178 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2019-11-28 02:54:50,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2019-11-28 02:54:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:54:50,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:50,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:50,181 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1435914485, now seen corresponding path program 1 times [2019-11-28 02:54:50,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:50,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95316990] [2019-11-28 02:54:50,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:50,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95316990] [2019-11-28 02:54:50,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:50,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:54:50,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817055064] [2019-11-28 02:54:50,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:54:50,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:54:50,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:54:50,328 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand 6 states. [2019-11-28 02:54:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:50,504 INFO L93 Difference]: Finished difference Result 245 states and 291 transitions. [2019-11-28 02:54:50,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:54:50,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 02:54:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:50,507 INFO L225 Difference]: With dead ends: 245 [2019-11-28 02:54:50,507 INFO L226 Difference]: Without dead ends: 244 [2019-11-28 02:54:50,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-28 02:54:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 152. [2019-11-28 02:54:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 02:54:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2019-11-28 02:54:50,523 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 20 [2019-11-28 02:54:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:50,524 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2019-11-28 02:54:50,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:54:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2019-11-28 02:54:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:54:50,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:50,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:50,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1468941615, now seen corresponding path program 1 times [2019-11-28 02:54:50,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:50,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933042309] [2019-11-28 02:54:50,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:50,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933042309] [2019-11-28 02:54:50,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:50,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:50,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543126312] [2019-11-28 02:54:50,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:54:50,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:54:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:54:50,720 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand 9 states. [2019-11-28 02:54:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:51,186 INFO L93 Difference]: Finished difference Result 478 states and 553 transitions. [2019-11-28 02:54:51,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:54:51,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 02:54:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:51,190 INFO L225 Difference]: With dead ends: 478 [2019-11-28 02:54:51,190 INFO L226 Difference]: Without dead ends: 423 [2019-11-28 02:54:51,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:54:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-11-28 02:54:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 216. [2019-11-28 02:54:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-28 02:54:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 267 transitions. [2019-11-28 02:54:51,214 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 267 transitions. Word has length 22 [2019-11-28 02:54:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:51,214 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 267 transitions. [2019-11-28 02:54:51,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:54:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 267 transitions. [2019-11-28 02:54:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:54:51,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:51,216 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:51,216 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:51,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1469001197, now seen corresponding path program 1 times [2019-11-28 02:54:51,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:51,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053564141] [2019-11-28 02:54:51,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:51,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053564141] [2019-11-28 02:54:51,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:51,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:54:51,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452300556] [2019-11-28 02:54:51,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:51,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:51,384 INFO L87 Difference]: Start difference. First operand 216 states and 267 transitions. Second operand 8 states. [2019-11-28 02:54:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:51,641 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2019-11-28 02:54:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:54:51,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-28 02:54:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:51,644 INFO L225 Difference]: With dead ends: 286 [2019-11-28 02:54:51,644 INFO L226 Difference]: Without dead ends: 285 [2019-11-28 02:54:51,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:54:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-28 02:54:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 225. [2019-11-28 02:54:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-28 02:54:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 278 transitions. [2019-11-28 02:54:51,664 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 278 transitions. Word has length 22 [2019-11-28 02:54:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:51,665 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 278 transitions. [2019-11-28 02:54:51,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 278 transitions. [2019-11-28 02:54:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:54:51,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:51,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:51,666 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:51,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1229309041, now seen corresponding path program 1 times [2019-11-28 02:54:51,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:51,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050410122] [2019-11-28 02:54:51,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:52,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050410122] [2019-11-28 02:54:52,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:52,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:54:52,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842751198] [2019-11-28 02:54:52,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:52,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:52,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:52,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:52,024 INFO L87 Difference]: Start difference. First operand 225 states and 278 transitions. Second operand 8 states. [2019-11-28 02:54:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:52,512 INFO L93 Difference]: Finished difference Result 400 states and 480 transitions. [2019-11-28 02:54:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:54:52,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-28 02:54:52,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:52,515 INFO L225 Difference]: With dead ends: 400 [2019-11-28 02:54:52,515 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 02:54:52,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:54:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 02:54:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 258. [2019-11-28 02:54:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-28 02:54:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 321 transitions. [2019-11-28 02:54:52,538 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 321 transitions. Word has length 22 [2019-11-28 02:54:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:52,539 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 321 transitions. [2019-11-28 02:54:52,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 321 transitions. [2019-11-28 02:54:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:54:52,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:52,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:52,541 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:52,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1239889621, now seen corresponding path program 1 times [2019-11-28 02:54:52,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:52,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416851024] [2019-11-28 02:54:52,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:52,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416851024] [2019-11-28 02:54:52,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:52,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:52,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423742299] [2019-11-28 02:54:52,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:52,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:52,674 INFO L87 Difference]: Start difference. First operand 258 states and 321 transitions. Second operand 8 states. [2019-11-28 02:54:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:52,849 INFO L93 Difference]: Finished difference Result 296 states and 352 transitions. [2019-11-28 02:54:52,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:54:52,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-28 02:54:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:52,851 INFO L225 Difference]: With dead ends: 296 [2019-11-28 02:54:52,851 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 02:54:52,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:54:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 02:54:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 201. [2019-11-28 02:54:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-28 02:54:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions. [2019-11-28 02:54:52,867 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 249 transitions. Word has length 22 [2019-11-28 02:54:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:52,867 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 249 transitions. [2019-11-28 02:54:52,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions. [2019-11-28 02:54:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:54:52,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:52,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:52,869 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1089831035, now seen corresponding path program 1 times [2019-11-28 02:54:52,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:52,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812844461] [2019-11-28 02:54:52,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:52,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812844461] [2019-11-28 02:54:52,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:52,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:52,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718516818] [2019-11-28 02:54:52,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:52,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:52,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:52,944 INFO L87 Difference]: Start difference. First operand 201 states and 249 transitions. Second operand 8 states. [2019-11-28 02:54:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:53,206 INFO L93 Difference]: Finished difference Result 237 states and 285 transitions. [2019-11-28 02:54:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:54:53,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 02:54:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:53,208 INFO L225 Difference]: With dead ends: 237 [2019-11-28 02:54:53,208 INFO L226 Difference]: Without dead ends: 188 [2019-11-28 02:54:53,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:54:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-28 02:54:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2019-11-28 02:54:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 02:54:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 226 transitions. [2019-11-28 02:54:53,230 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 226 transitions. Word has length 24 [2019-11-28 02:54:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:53,230 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 226 transitions. [2019-11-28 02:54:53,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2019-11-28 02:54:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:54:53,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:53,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:53,232 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1968302766, now seen corresponding path program 1 times [2019-11-28 02:54:53,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:53,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149135054] [2019-11-28 02:54:53,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:53,691 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-11-28 02:54:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:53,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149135054] [2019-11-28 02:54:53,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:53,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:54:53,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454227537] [2019-11-28 02:54:53,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:53,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:53,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:53,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:53,758 INFO L87 Difference]: Start difference. First operand 184 states and 226 transitions. Second operand 8 states. [2019-11-28 02:54:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:54,150 INFO L93 Difference]: Finished difference Result 265 states and 314 transitions. [2019-11-28 02:54:54,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:54:54,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 02:54:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:54,153 INFO L225 Difference]: With dead ends: 265 [2019-11-28 02:54:54,153 INFO L226 Difference]: Without dead ends: 264 [2019-11-28 02:54:54,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:54:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-28 02:54:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 184. [2019-11-28 02:54:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 02:54:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2019-11-28 02:54:54,169 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 24 [2019-11-28 02:54:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:54,170 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2019-11-28 02:54:54,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2019-11-28 02:54:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:54:54,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:54,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:54,171 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1696098322, now seen corresponding path program 1 times [2019-11-28 02:54:54,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:54,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882883027] [2019-11-28 02:54:54,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:54:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:54:54,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:54:54,230 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:54:54,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:54:54 BoogieIcfgContainer [2019-11-28 02:54:54,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:54:54,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:54:54,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:54:54,272 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:54:54,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:47" (3/4) ... [2019-11-28 02:54:54,277 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:54:54,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:54:54,284 INFO L168 Benchmark]: Toolchain (without parser) took 7901.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.4 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -259.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:54,285 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:54,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -99.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:54,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:54,293 INFO L168 Benchmark]: Boogie Preprocessor took 44.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:54,295 INFO L168 Benchmark]: RCFGBuilder took 694.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:54,296 INFO L168 Benchmark]: TraceAbstraction took 6598.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -206.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:54,296 INFO L168 Benchmark]: Witness Printer took 5.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:54,301 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 496.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -99.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 694.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6598.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -206.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add1 ; [L224] unsigned int r_add2 ; [L225] unsigned int zero ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int __retres14 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L232] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] EXPR e + 128 [L68] res = m | ((unsigned int )(e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L233] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND TRUE m >= 1U << 25U [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U [L71] return (__retres4); [L234] b = base2flt(mb, eb) [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] EXPR (int )(a >> 24U) - 128 [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 38 error locations. Result: UNSAFE, OverallTime: 6.4s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2467 SDtfs, 3174 SDslu, 5632 SDs, 0 SdLazy, 1577 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 22248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...