./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer --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 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/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-678e011 [2019-11-20 11:37:16,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:37:16,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:37:16,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:37:16,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:37:16,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:37:16,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:37:16,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:37:16,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:37:16,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:37:16,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:37:16,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:37:16,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:37:16,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:37:16,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:37:16,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:37:16,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:37:16,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:37:16,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:37:16,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:37:16,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:37:16,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:37:16,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:37:16,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:37:16,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:37:16,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:37:16,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:37:16,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:37:16,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:37:16,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:37:16,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:37:16,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:37:16,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:37:16,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:37:16,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:37:16,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:37:16,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:37:16,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:37:16,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:37:16,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:37:16,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:37:16,750 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-20 11:37:16,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:37:16,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:37:16,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:37:16,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:37:16,767 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:37:16,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:37:16,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:37:16,768 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:37:16,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:37:16,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:37:16,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:37:16,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:37:16,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:37:16,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:37:16,770 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-20 11:37:16,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:37:16,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:37:16,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:37:16,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:37:16,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:37:16,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:37:16,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:37:16,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:37:16,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:37:16,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:37:16,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:37:16,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:37:16,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:37:16,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:37:16,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:37:16,773 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer 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 -> 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 [2019-11-20 11:37:17,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:37:17,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:37:17,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:37:17,021 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:37:17,021 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:37:17,023 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-20 11:37:17,090 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/data/e631a95d9/3818626f6a224dcb827cb3a373132848/FLAGe22326640 [2019-11-20 11:37:17,548 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:37:17,549 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-20 11:37:17,565 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/data/e631a95d9/3818626f6a224dcb827cb3a373132848/FLAGe22326640 [2019-11-20 11:37:17,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/data/e631a95d9/3818626f6a224dcb827cb3a373132848 [2019-11-20 11:37:17,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:37:17,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:37:17,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:37:17,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:37:17,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:37:17,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:37:17" (1/1) ... [2019-11-20 11:37:17,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300298ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:17, skipping insertion in model container [2019-11-20 11:37:17,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:37:17" (1/1) ... [2019-11-20 11:37:17,925 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:37:17,982 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:37:18,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:37:18,378 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:37:18,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:37:18,451 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:37:18,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18 WrapperNode [2019-11-20 11:37:18,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:37:18,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:37:18,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:37:18,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:37:18,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:37:18,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:37:18,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:37:18,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:37:18,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... [2019-11-20 11:37:18,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:37:18,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:37:18,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:37:18,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:37:18,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ba6b33-22a6-47c1-bac0-420842a17271/bin/uautomizer/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-20 11:37:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:37:18,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:37:19,323 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:37:19,323 INFO L285 CfgBuilder]: Removed 28 assume(true) statements. [2019-11-20 11:37:19,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:19 BoogieIcfgContainer [2019-11-20 11:37:19,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:37:19,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:37:19,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:37:19,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:37:19,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:37:17" (1/3) ... [2019-11-20 11:37:19,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b77b085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:37:19, skipping insertion in model container [2019-11-20 11:37:19,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:18" (2/3) ... [2019-11-20 11:37:19,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b77b085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:37:19, skipping insertion in model container [2019-11-20 11:37:19,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:19" (3/3) ... [2019-11-20 11:37:19,334 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-11-20 11:37:19,346 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:37:19,354 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-20 11:37:19,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-20 11:37:19,411 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:37:19,412 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:37:19,412 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:37:19,412 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:37:19,412 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:37:19,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:37:19,413 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:37:19,413 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:37:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-11-20 11:37:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 11:37:19,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:19,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 11:37:19,473 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-11-20 11:37:19,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:19,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849115414] [2019-11-20 11:37:19,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:19,623 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-20 11:37:19,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849115414] [2019-11-20 11:37:19,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:19,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:37:19,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990796981] [2019-11-20 11:37:19,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 11:37:19,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:19,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 11:37:19,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 11:37:19,649 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 2 states. [2019-11-20 11:37:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:19,684 INFO L93 Difference]: Finished difference Result 263 states and 369 transitions. [2019-11-20 11:37:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 11:37:19,686 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-20 11:37:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:19,699 INFO L225 Difference]: With dead ends: 263 [2019-11-20 11:37:19,699 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 11:37:19,703 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-20 11:37:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 11:37:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 11:37:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 11:37:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2019-11-20 11:37:19,753 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 6 [2019-11-20 11:37:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:19,754 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2019-11-20 11:37:19,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 11:37:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2019-11-20 11:37:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 11:37:19,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:19,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 11:37:19,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-11-20 11:37:19,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:19,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792956312] [2019-11-20 11:37:19,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:19,825 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-20 11:37:19,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792956312] [2019-11-20 11:37:19,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:19,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:37:19,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444008565] [2019-11-20 11:37:19,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:19,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:19,830 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand 4 states. [2019-11-20 11:37:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:20,039 INFO L93 Difference]: Finished difference Result 224 states and 269 transitions. [2019-11-20 11:37:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:20,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-20 11:37:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:20,042 INFO L225 Difference]: With dead ends: 224 [2019-11-20 11:37:20,042 INFO L226 Difference]: Without dead ends: 122 [2019-11-20 11:37:20,044 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-20 11:37:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-20 11:37:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2019-11-20 11:37:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 11:37:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-11-20 11:37:20,056 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 6 [2019-11-20 11:37:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:20,056 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-11-20 11:37:20,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-11-20 11:37:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 11:37:20,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:20,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:20,058 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-11-20 11:37:20,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:20,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784270102] [2019-11-20 11:37:20,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:20,115 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-20 11:37:20,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784270102] [2019-11-20 11:37:20,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:20,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:37:20,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331986521] [2019-11-20 11:37:20,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:20,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:20,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:20,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:20,117 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 4 states. [2019-11-20 11:37:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:20,252 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2019-11-20 11:37:20,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:20,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 11:37:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:20,258 INFO L225 Difference]: With dead ends: 129 [2019-11-20 11:37:20,258 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 11:37:20,259 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-20 11:37:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 11:37:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-11-20 11:37:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 11:37:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-20 11:37:20,279 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 9 [2019-11-20 11:37:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:20,280 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-20 11:37:20,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-20 11:37:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 11:37:20,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:20,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:20,281 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-11-20 11:37:20,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:20,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533338333] [2019-11-20 11:37:20,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:20,339 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-20 11:37:20,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533338333] [2019-11-20 11:37:20,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:20,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:37:20,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974056409] [2019-11-20 11:37:20,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:37:20,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:37:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:37:20,342 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 3 states. [2019-11-20 11:37:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:20,407 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2019-11-20 11:37:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:37:20,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 11:37:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:20,412 INFO L225 Difference]: With dead ends: 123 [2019-11-20 11:37:20,413 INFO L226 Difference]: Without dead ends: 121 [2019-11-20 11:37:20,413 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-20 11:37:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-20 11:37:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 83. [2019-11-20 11:37:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-20 11:37:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-20 11:37:20,431 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 10 [2019-11-20 11:37:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:20,431 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-20 11:37:20,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:37:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-20 11:37:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 11:37:20,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:20,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:20,433 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:20,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-11-20 11:37:20,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:20,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881964426] [2019-11-20 11:37:20,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:20,490 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-20 11:37:20,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881964426] [2019-11-20 11:37:20,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:20,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:37:20,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498056052] [2019-11-20 11:37:20,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:20,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:20,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:20,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:20,492 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 4 states. [2019-11-20 11:37:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:20,584 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2019-11-20 11:37:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:20,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 11:37:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:20,586 INFO L225 Difference]: With dead ends: 127 [2019-11-20 11:37:20,586 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 11:37:20,587 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-20 11:37:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 11:37:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-11-20 11:37:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 11:37:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-20 11:37:20,599 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 11 [2019-11-20 11:37:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:20,600 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-20 11:37:20,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-20 11:37:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 11:37:20,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:20,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:20,602 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-11-20 11:37:20,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:20,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302230740] [2019-11-20 11:37:20,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:20,681 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-20 11:37:20,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302230740] [2019-11-20 11:37:20,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:20,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:37:20,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916615540] [2019-11-20 11:37:20,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:20,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:20,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:20,683 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 4 states. [2019-11-20 11:37:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:20,780 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-11-20 11:37:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:20,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-20 11:37:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:20,783 INFO L225 Difference]: With dead ends: 130 [2019-11-20 11:37:20,783 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 11:37:20,783 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-20 11:37:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 11:37:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2019-11-20 11:37:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 11:37:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2019-11-20 11:37:20,805 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 12 [2019-11-20 11:37:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:20,805 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2019-11-20 11:37:20,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2019-11-20 11:37:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 11:37:20,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:20,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:20,807 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:20,807 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-11-20 11:37:20,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:20,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166771254] [2019-11-20 11:37:20,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:20,877 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-20 11:37:20,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166771254] [2019-11-20 11:37:20,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:20,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:37:20,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166727744] [2019-11-20 11:37:20,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:20,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:20,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:20,879 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2019-11-20 11:37:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:20,997 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-11-20 11:37:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:20,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 11:37:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:21,001 INFO L225 Difference]: With dead ends: 172 [2019-11-20 11:37:21,001 INFO L226 Difference]: Without dead ends: 170 [2019-11-20 11:37:21,002 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-20 11:37:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-20 11:37:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 87. [2019-11-20 11:37:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 11:37:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-11-20 11:37:21,020 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 14 [2019-11-20 11:37:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:21,020 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-11-20 11:37:21,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-11-20 11:37:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 11:37:21,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:21,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:21,029 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-11-20 11:37:21,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:21,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746617028] [2019-11-20 11:37:21,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:21,106 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-20 11:37:21,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746617028] [2019-11-20 11:37:21,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:21,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:37:21,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444566015] [2019-11-20 11:37:21,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:21,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:21,109 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 4 states. [2019-11-20 11:37:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:21,197 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2019-11-20 11:37:21,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:21,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 11:37:21,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:21,200 INFO L225 Difference]: With dead ends: 127 [2019-11-20 11:37:21,200 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 11:37:21,201 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-20 11:37:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 11:37:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 82. [2019-11-20 11:37:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 11:37:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-11-20 11:37:21,212 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 14 [2019-11-20 11:37:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:21,212 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-11-20 11:37:21,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-11-20 11:37:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 11:37:21,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:21,214 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:21,214 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:21,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-11-20 11:37:21,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:21,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908423449] [2019-11-20 11:37:21,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:21,279 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-20 11:37:21,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908423449] [2019-11-20 11:37:21,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:21,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:37:21,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327930321] [2019-11-20 11:37:21,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:21,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:21,282 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 4 states. [2019-11-20 11:37:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:21,394 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2019-11-20 11:37:21,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:21,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 11:37:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:21,397 INFO L225 Difference]: With dead ends: 162 [2019-11-20 11:37:21,397 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 11:37:21,398 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-20 11:37:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 11:37:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 72. [2019-11-20 11:37:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 11:37:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-11-20 11:37:21,414 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 15 [2019-11-20 11:37:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:21,415 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-11-20 11:37:21,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-11-20 11:37:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 11:37:21,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:21,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:21,417 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash -324557016, now seen corresponding path program 1 times [2019-11-20 11:37:21,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:21,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135755466] [2019-11-20 11:37:21,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:21,695 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-20 11:37:21,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135755466] [2019-11-20 11:37:21,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:21,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 11:37:21,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391658867] [2019-11-20 11:37:21,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 11:37:21,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 11:37:21,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:37:21,698 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 9 states. [2019-11-20 11:37:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:22,017 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2019-11-20 11:37:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:37:22,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-20 11:37:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:22,019 INFO L225 Difference]: With dead ends: 114 [2019-11-20 11:37:22,019 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 11:37:22,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:37:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 11:37:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-20 11:37:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 11:37:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-20 11:37:22,028 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 17 [2019-11-20 11:37:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:22,028 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-20 11:37:22,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 11:37:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-20 11:37:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:37:22,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:22,030 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] [2019-11-20 11:37:22,030 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:22,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:22,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1112826903, now seen corresponding path program 1 times [2019-11-20 11:37:22,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:22,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219313181] [2019-11-20 11:37:22,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:22,226 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-20 11:37:22,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219313181] [2019-11-20 11:37:22,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:22,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 11:37:22,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541688634] [2019-11-20 11:37:22,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:37:22,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:37:22,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:37:22,228 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 8 states. [2019-11-20 11:37:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:22,524 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2019-11-20 11:37:22,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:37:22,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 11:37:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:22,526 INFO L225 Difference]: With dead ends: 162 [2019-11-20 11:37:22,527 INFO L226 Difference]: Without dead ends: 134 [2019-11-20 11:37:22,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:37:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-20 11:37:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2019-11-20 11:37:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-20 11:37:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-20 11:37:22,537 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 21 [2019-11-20 11:37:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:22,538 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-20 11:37:22,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:37:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-20 11:37:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 11:37:22,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:22,539 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] [2019-11-20 11:37:22,540 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2013141521, now seen corresponding path program 1 times [2019-11-20 11:37:22,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:22,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770439354] [2019-11-20 11:37:22,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:22,728 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-20 11:37:22,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770439354] [2019-11-20 11:37:22,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:22,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 11:37:22,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409358911] [2019-11-20 11:37:22,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:37:22,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:37:22,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:37:22,731 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 8 states. [2019-11-20 11:37:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:23,078 INFO L93 Difference]: Finished difference Result 232 states and 273 transitions. [2019-11-20 11:37:23,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:37:23,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-20 11:37:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:23,081 INFO L225 Difference]: With dead ends: 232 [2019-11-20 11:37:23,081 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 11:37:23,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 11:37:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 11:37:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 130. [2019-11-20 11:37:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 11:37:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2019-11-20 11:37:23,093 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 23 [2019-11-20 11:37:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:23,094 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2019-11-20 11:37:23,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:37:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2019-11-20 11:37:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 11:37:23,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:23,095 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] [2019-11-20 11:37:23,095 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1836591731, now seen corresponding path program 1 times [2019-11-20 11:37:23,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:23,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588992649] [2019-11-20 11:37:23,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:23,212 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-20 11:37:23,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588992649] [2019-11-20 11:37:23,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:23,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 11:37:23,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094919333] [2019-11-20 11:37:23,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:37:23,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:23,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:37:23,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:37:23,214 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand 8 states. [2019-11-20 11:37:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:23,564 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2019-11-20 11:37:23,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:37:23,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-20 11:37:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:23,566 INFO L225 Difference]: With dead ends: 162 [2019-11-20 11:37:23,566 INFO L226 Difference]: Without dead ends: 90 [2019-11-20 11:37:23,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:37:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-20 11:37:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-20 11:37:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-20 11:37:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2019-11-20 11:37:23,575 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 23 [2019-11-20 11:37:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:23,575 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2019-11-20 11:37:23,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:37:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2019-11-20 11:37:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 11:37:23,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:23,576 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, 1] [2019-11-20 11:37:23,577 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:23,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:23,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1319121376, now seen corresponding path program 1 times [2019-11-20 11:37:23,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:23,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543530521] [2019-11-20 11:37:23,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:23,720 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-20 11:37:23,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543530521] [2019-11-20 11:37:23,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:23,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 11:37:23,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231977029] [2019-11-20 11:37:23,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 11:37:23,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:23,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:37:23,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:37:23,723 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand 7 states. [2019-11-20 11:37:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:24,002 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2019-11-20 11:37:24,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:37:24,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-20 11:37:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:24,005 INFO L225 Difference]: With dead ends: 294 [2019-11-20 11:37:24,005 INFO L226 Difference]: Without dead ends: 250 [2019-11-20 11:37:24,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:37:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-20 11:37:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 130. [2019-11-20 11:37:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 11:37:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2019-11-20 11:37:24,019 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 27 [2019-11-20 11:37:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:24,019 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2019-11-20 11:37:24,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 11:37:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2019-11-20 11:37:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:37:24,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:24,020 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, 1, 1, 1] [2019-11-20 11:37:24,021 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash 590911882, now seen corresponding path program 1 times [2019-11-20 11:37:24,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:24,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339140121] [2019-11-20 11:37:24,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:24,365 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-20 11:37:24,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339140121] [2019-11-20 11:37:24,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:24,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 11:37:24,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512939241] [2019-11-20 11:37:24,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 11:37:24,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 11:37:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:37:24,368 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand 9 states. [2019-11-20 11:37:24,757 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-20 11:37:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:24,861 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2019-11-20 11:37:24,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 11:37:24,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-20 11:37:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:24,865 INFO L225 Difference]: With dead ends: 175 [2019-11-20 11:37:24,865 INFO L226 Difference]: Without dead ends: 174 [2019-11-20 11:37:24,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:37:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-20 11:37:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 120. [2019-11-20 11:37:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 11:37:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2019-11-20 11:37:24,882 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 29 [2019-11-20 11:37:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:24,883 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2019-11-20 11:37:24,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 11:37:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2019-11-20 11:37:24,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:37:24,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:24,885 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, 1, 1, 1] [2019-11-20 11:37:24,886 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:24,886 INFO L82 PathProgramCache]: Analyzing trace with hash 767461672, now seen corresponding path program 1 times [2019-11-20 11:37:24,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:24,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51637373] [2019-11-20 11:37:24,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:25,018 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-20 11:37:25,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51637373] [2019-11-20 11:37:25,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:25,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:37:25,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343136315] [2019-11-20 11:37:25,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:37:25,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:37:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:37:25,021 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand 6 states. [2019-11-20 11:37:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:25,157 INFO L93 Difference]: Finished difference Result 166 states and 197 transitions. [2019-11-20 11:37:25,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:37:25,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-20 11:37:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:25,159 INFO L225 Difference]: With dead ends: 166 [2019-11-20 11:37:25,159 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 11:37:25,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:37:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 11:37:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-11-20 11:37:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 11:37:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2019-11-20 11:37:25,169 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 29 [2019-11-20 11:37:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:25,170 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2019-11-20 11:37:25,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:37:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2019-11-20 11:37:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 11:37:25,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:25,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, 1, 1, 1, 1, 1] [2019-11-20 11:37:25,171 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1093653162, now seen corresponding path program 1 times [2019-11-20 11:37:25,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:25,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829147779] [2019-11-20 11:37:25,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:25,301 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-20 11:37:25,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829147779] [2019-11-20 11:37:25,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:25,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 11:37:25,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321977166] [2019-11-20 11:37:25,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:37:25,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:37:25,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:37:25,304 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 6 states. [2019-11-20 11:37:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:25,517 INFO L93 Difference]: Finished difference Result 227 states and 251 transitions. [2019-11-20 11:37:25,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:37:25,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-20 11:37:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:25,520 INFO L225 Difference]: With dead ends: 227 [2019-11-20 11:37:25,520 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 11:37:25,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 11:37:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 11:37:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 127. [2019-11-20 11:37:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-20 11:37:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2019-11-20 11:37:25,534 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 31 [2019-11-20 11:37:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:25,534 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2019-11-20 11:37:25,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:37:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2019-11-20 11:37:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 11:37:25,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:25,535 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:25,536 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_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.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 11:37:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash 964745492, now seen corresponding path program 1 times [2019-11-20 11:37:25,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:25,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178905156] [2019-11-20 11:37:25,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:37:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:37:25,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:37:25,641 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 11:37:25,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:37:25 BoogieIcfgContainer [2019-11-20 11:37:25,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 11:37:25,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:37:25,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:37:25,699 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:37:25,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:19" (3/4) ... [2019-11-20 11:37:25,705 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 11:37:25,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:37:25,714 INFO L168 Benchmark]: Toolchain (without parser) took 7809.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 950.1 MB in the beginning and 921.3 MB in the end (delta: 28.8 MB). Peak memory consumption was 257.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:25,714 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:37:25,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:25,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:25,717 INFO L168 Benchmark]: Boogie Preprocessor took 40.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:37:25,721 INFO L168 Benchmark]: RCFGBuilder took 769.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:25,724 INFO L168 Benchmark]: TraceAbstraction took 6371.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 921.3 MB in the end (delta: 170.8 MB). Peak memory consumption was 248.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:25,725 INFO L168 Benchmark]: Witness Printer took 7.37 ms. Allocated memory is still 1.3 GB. Free memory is still 921.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:37:25,730 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 549.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 769.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6371.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 921.3 MB in the end (delta: 170.8 MB). Peak memory consumption was 248.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.37 ms. Allocated memory is still 1.3 GB. Free memory is still 921.3 MB. 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_add ; [L224] unsigned int zero ; [L225] int sa ; [L226] int sb ; [L227] int tmp ; [L228] int tmp___0 ; [L229] int tmp___1 ; [L230] int tmp___2 ; [L231] int tmp___3 ; [L232] int tmp___4 ; [L233] int tmp___5 ; [L234] int tmp___6 ; [L235] int tmp___7 ; [L236] int tmp___8 ; [L237] int tmp___9 ; [L238] int __retres23 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L242] 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); [L243] 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); [L244] b = base2flt(mb, eb) [L246] COND FALSE !(a < zero) [L249] COND TRUE a > zero [L250] tmp = 1 [L254] sa = tmp [L256] COND FALSE !(b < zero) [L259] COND TRUE b > zero [L260] tmp___0 = 1 [L264] sb = tmp___0 [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, 141 locations, 28 error locations. Result: UNSAFE, OverallTime: 6.2s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1850 SDtfs, 2173 SDslu, 4106 SDs, 0 SdLazy, 1090 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 760 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 33514 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...