./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/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 fa5701cbf2aecb18d72b6e5744b88307065d31ab ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/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.25-f470102 [2019-12-07 11:49:51,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:49:51,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:49:51,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:49:51,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:49:51,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:49:51,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:49:51,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:49:51,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:49:51,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:49:51,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:49:51,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:49:51,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:49:51,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:49:51,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:49:51,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:49:51,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:49:51,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:49:51,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:49:51,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:49:51,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:49:51,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:49:51,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:49:51,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:49:51,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:49:51,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:49:51,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:49:51,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:49:51,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:49:51,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:49:51,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:49:51,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:49:51,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:49:51,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:49:51,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:49:51,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:49:51,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:49:51,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:49:51,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:49:51,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:49:51,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:49:51,119 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-12-07 11:49:51,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:49:51,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:49:51,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:49:51,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:49:51,129 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:49:51,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:49:51,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:49:51,129 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:49:51,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:49:51,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:49:51,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:49:51,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:49:51,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:49:51,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:49:51,130 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 11:49:51,130 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:49:51,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:49:51,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:49:51,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:49:51,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:49:51,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:49:51,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:49:51,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:49:51,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:49:51,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:49:51,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:49:51,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:49:51,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:49:51,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:49:51,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:49:51,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:49:51,132 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_bf14cc1f-43f0-4b8f-a995-252acf6a3270/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 -> fa5701cbf2aecb18d72b6e5744b88307065d31ab [2019-12-07 11:49:51,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:49:51,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:49:51,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:49:51,245 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:49:51,245 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:49:51,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2019-12-07 11:49:51,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/data/8d8222316/46490ecc219f4c5988f8682f52f52aea/FLAG4619eaf9a [2019-12-07 11:49:51,712 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:49:51,712 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2019-12-07 11:49:51,718 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/data/8d8222316/46490ecc219f4c5988f8682f52f52aea/FLAG4619eaf9a [2019-12-07 11:49:51,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/bin/uautomizer/data/8d8222316/46490ecc219f4c5988f8682f52f52aea [2019-12-07 11:49:51,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:49:51,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:49:51,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:49:51,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:49:51,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:49:51,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:51,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553e53bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51, skipping insertion in model container [2019-12-07 11:49:51,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:51,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:49:51,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:49:51,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:49:51,934 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:49:51,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:49:51,968 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:49:51,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51 WrapperNode [2019-12-07 11:49:51,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:49:51,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:49:51,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:49:51,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:49:51,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:51,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:52,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:49:52,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:49:52,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:49:52,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:49:52,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:52,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:52,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:52,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:52,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:52,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:52,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... [2019-12-07 11:49:52,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:49:52,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:49:52,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:49:52,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:49:52,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf14cc1f-43f0-4b8f-a995-252acf6a3270/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-12-07 11:49:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:49:52,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:49:52,373 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:49:52,373 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-12-07 11:49:52,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:52 BoogieIcfgContainer [2019-12-07 11:49:52,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:49:52,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:49:52,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:49:52,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:49:52,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:49:51" (1/3) ... [2019-12-07 11:49:52,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f6213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:49:52, skipping insertion in model container [2019-12-07 11:49:52,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:51" (2/3) ... [2019-12-07 11:49:52,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f6213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:49:52, skipping insertion in model container [2019-12-07 11:49:52,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:52" (3/3) ... [2019-12-07 11:49:52,379 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2019-12-07 11:49:52,385 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:49:52,389 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-12-07 11:49:52,397 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-12-07 11:49:52,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:49:52,414 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:49:52,414 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:49:52,414 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:49:52,414 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:49:52,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:49:52,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:49:52,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:49:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-12-07 11:49:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:49:52,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:52,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:49:52,436 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-12-07 11:49:52,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:52,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34586595] [2019-12-07 11:49:52,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:52,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34586595] [2019-12-07 11:49:52,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:52,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:52,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968737916] [2019-12-07 11:49:52,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:49:52,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:49:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:49:52,537 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 2 states. [2019-12-07 11:49:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:52,558 INFO L93 Difference]: Finished difference Result 283 states and 373 transitions. [2019-12-07 11:49:52,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:49:52,559 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-12-07 11:49:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:52,567 INFO L225 Difference]: With dead ends: 283 [2019-12-07 11:49:52,567 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 11:49:52,570 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-12-07 11:49:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 11:49:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-12-07 11:49:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 11:49:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2019-12-07 11:49:52,599 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 6 [2019-12-07 11:49:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:52,599 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2019-12-07 11:49:52,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:49:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2019-12-07 11:49:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:49:52,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:52,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:49:52,600 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-12-07 11:49:52,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:52,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377291974] [2019-12-07 11:49:52,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:52,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377291974] [2019-12-07 11:49:52,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:52,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:52,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984604376] [2019-12-07 11:49:52,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:52,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:52,639 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 4 states. [2019-12-07 11:49:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:52,735 INFO L93 Difference]: Finished difference Result 302 states and 350 transitions. [2019-12-07 11:49:52,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:52,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 11:49:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:52,737 INFO L225 Difference]: With dead ends: 302 [2019-12-07 11:49:52,738 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 11:49:52,739 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-12-07 11:49:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 11:49:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 110. [2019-12-07 11:49:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 11:49:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2019-12-07 11:49:52,750 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 6 [2019-12-07 11:49:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:52,750 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2019-12-07 11:49:52,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2019-12-07 11:49:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:49:52,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:52,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:52,751 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:52,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-12-07 11:49:52,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:52,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332772271] [2019-12-07 11:49:52,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:52,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332772271] [2019-12-07 11:49:52,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:52,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:52,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613763373] [2019-12-07 11:49:52,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:52,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:52,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:52,784 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand 4 states. [2019-12-07 11:49:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:52,828 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2019-12-07 11:49:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:52,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 11:49:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:52,830 INFO L225 Difference]: With dead ends: 181 [2019-12-07 11:49:52,830 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 11:49:52,830 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-12-07 11:49:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 11:49:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 111. [2019-12-07 11:49:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 11:49:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2019-12-07 11:49:52,838 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 9 [2019-12-07 11:49:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:52,838 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2019-12-07 11:49:52,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2019-12-07 11:49:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:49:52,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:52,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:52,839 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:52,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:52,839 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-12-07 11:49:52,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:52,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807155281] [2019-12-07 11:49:52,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:52,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807155281] [2019-12-07 11:49:52,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:52,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:52,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857180164] [2019-12-07 11:49:52,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:49:52,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:52,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:49:52,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:52,860 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand 3 states. [2019-12-07 11:49:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:52,893 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2019-12-07 11:49:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:49:52,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 11:49:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:52,894 INFO L225 Difference]: With dead ends: 175 [2019-12-07 11:49:52,894 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 11:49:52,895 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-12-07 11:49:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 11:49:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-12-07 11:49:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 11:49:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2019-12-07 11:49:52,902 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 10 [2019-12-07 11:49:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:52,902 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2019-12-07 11:49:52,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:49:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2019-12-07 11:49:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:49:52,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:52,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:52,903 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:52,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-12-07 11:49:52,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:52,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224715516] [2019-12-07 11:49:52,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:52,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224715516] [2019-12-07 11:49:52,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:52,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:52,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243827241] [2019-12-07 11:49:52,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:52,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:52,927 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 4 states. [2019-12-07 11:49:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:52,968 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2019-12-07 11:49:52,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:52,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:49:52,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:52,970 INFO L225 Difference]: With dead ends: 179 [2019-12-07 11:49:52,970 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 11:49:52,970 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-12-07 11:49:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 11:49:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 111. [2019-12-07 11:49:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 11:49:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2019-12-07 11:49:52,977 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 11 [2019-12-07 11:49:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:52,977 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2019-12-07 11:49:52,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2019-12-07 11:49:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:49:52,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:52,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:52,978 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-12-07 11:49:52,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:52,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533741098] [2019-12-07 11:49:52,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:53,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533741098] [2019-12-07 11:49:53,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:53,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:53,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510009305] [2019-12-07 11:49:53,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:53,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:53,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:53,004 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand 4 states. [2019-12-07 11:49:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:53,050 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2019-12-07 11:49:53,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:53,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 11:49:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:53,051 INFO L225 Difference]: With dead ends: 182 [2019-12-07 11:49:53,052 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 11:49:53,052 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-12-07 11:49:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 11:49:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 114. [2019-12-07 11:49:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 11:49:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2019-12-07 11:49:53,058 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 12 [2019-12-07 11:49:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:53,058 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2019-12-07 11:49:53,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2019-12-07 11:49:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:49:53,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:53,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:53,059 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-12-07 11:49:53,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:53,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086650563] [2019-12-07 11:49:53,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:53,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086650563] [2019-12-07 11:49:53,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:53,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:49:53,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710865169] [2019-12-07 11:49:53,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:53,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:53,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:53,084 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2019-12-07 11:49:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:53,135 INFO L93 Difference]: Finished difference Result 250 states and 284 transitions. [2019-12-07 11:49:53,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:53,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:49:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:53,137 INFO L225 Difference]: With dead ends: 250 [2019-12-07 11:49:53,137 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 11:49:53,138 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-12-07 11:49:53,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 11:49:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 113. [2019-12-07 11:49:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 11:49:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2019-12-07 11:49:53,143 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 14 [2019-12-07 11:49:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:53,143 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2019-12-07 11:49:53,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2019-12-07 11:49:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:49:53,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:53,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:53,145 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:53,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1259484934, now seen corresponding path program 1 times [2019-12-07 11:49:53,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:53,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682282569] [2019-12-07 11:49:53,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:53,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682282569] [2019-12-07 11:49:53,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:53,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:49:53,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599431704] [2019-12-07 11:49:53,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:53,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:53,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:53,236 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand 8 states. [2019-12-07 11:49:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:53,483 INFO L93 Difference]: Finished difference Result 279 states and 325 transitions. [2019-12-07 11:49:53,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:49:53,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 11:49:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:53,484 INFO L225 Difference]: With dead ends: 279 [2019-12-07 11:49:53,484 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 11:49:53,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:49:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 11:49:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 164. [2019-12-07 11:49:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 11:49:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 199 transitions. [2019-12-07 11:49:53,494 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 199 transitions. Word has length 14 [2019-12-07 11:49:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:53,494 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 199 transitions. [2019-12-07 11:49:53,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 199 transitions. [2019-12-07 11:49:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:49:53,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:53,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:53,496 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:53,496 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-12-07 11:49:53,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:53,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431962505] [2019-12-07 11:49:53,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:53,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431962505] [2019-12-07 11:49:53,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:53,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:53,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610273904] [2019-12-07 11:49:53,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:53,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:53,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:53,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:53,519 INFO L87 Difference]: Start difference. First operand 164 states and 199 transitions. Second operand 4 states. [2019-12-07 11:49:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:53,564 INFO L93 Difference]: Finished difference Result 259 states and 308 transitions. [2019-12-07 11:49:53,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:53,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:49:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:53,566 INFO L225 Difference]: With dead ends: 259 [2019-12-07 11:49:53,567 INFO L226 Difference]: Without dead ends: 257 [2019-12-07 11:49:53,567 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-12-07 11:49:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-12-07 11:49:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 156. [2019-12-07 11:49:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 11:49:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2019-12-07 11:49:53,584 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 14 [2019-12-07 11:49:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:53,584 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2019-12-07 11:49:53,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2019-12-07 11:49:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:49:53,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:53,586 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:53,586 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:53,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-12-07 11:49:53,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:53,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839486193] [2019-12-07 11:49:53,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:53,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839486193] [2019-12-07 11:49:53,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:53,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:49:53,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491750296] [2019-12-07 11:49:53,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:53,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:53,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:53,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:53,609 INFO L87 Difference]: Start difference. First operand 156 states and 189 transitions. Second operand 4 states. [2019-12-07 11:49:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:53,657 INFO L93 Difference]: Finished difference Result 286 states and 336 transitions. [2019-12-07 11:49:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:53,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:49:53,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:53,659 INFO L225 Difference]: With dead ends: 286 [2019-12-07 11:49:53,659 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 11:49:53,660 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-12-07 11:49:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 11:49:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 142. [2019-12-07 11:49:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 11:49:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 171 transitions. [2019-12-07 11:49:53,667 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 171 transitions. Word has length 15 [2019-12-07 11:49:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:53,667 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 171 transitions. [2019-12-07 11:49:53,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 171 transitions. [2019-12-07 11:49:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:49:53,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:53,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:53,669 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1435914485, now seen corresponding path program 1 times [2019-12-07 11:49:53,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:53,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810731252] [2019-12-07 11:49:53,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:53,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810731252] [2019-12-07 11:49:53,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:53,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:49:53,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562292066] [2019-12-07 11:49:53,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:49:53,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:53,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:49:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:49:53,750 INFO L87 Difference]: Start difference. First operand 142 states and 171 transitions. Second operand 6 states. [2019-12-07 11:49:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:53,857 INFO L93 Difference]: Finished difference Result 259 states and 305 transitions. [2019-12-07 11:49:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:49:53,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 11:49:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:53,859 INFO L225 Difference]: With dead ends: 259 [2019-12-07 11:49:53,859 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 11:49:53,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 11:49:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 158. [2019-12-07 11:49:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 11:49:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2019-12-07 11:49:53,868 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 20 [2019-12-07 11:49:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:53,868 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2019-12-07 11:49:53,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:49:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2019-12-07 11:49:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:49:53,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:53,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:53,869 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:53,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:53,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776175, now seen corresponding path program 1 times [2019-12-07 11:49:53,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:53,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709783193] [2019-12-07 11:49:53,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:53,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709783193] [2019-12-07 11:49:53,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:53,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:49:53,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736522882] [2019-12-07 11:49:53,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:53,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:53,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:53,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:53,948 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand 8 states. [2019-12-07 11:49:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:54,268 INFO L93 Difference]: Finished difference Result 540 states and 619 transitions. [2019-12-07 11:49:54,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:49:54,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 11:49:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:54,271 INFO L225 Difference]: With dead ends: 540 [2019-12-07 11:49:54,271 INFO L226 Difference]: Without dead ends: 508 [2019-12-07 11:49:54,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:49:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-07 11:49:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 227. [2019-12-07 11:49:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-12-07 11:49:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 282 transitions. [2019-12-07 11:49:54,282 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 282 transitions. Word has length 22 [2019-12-07 11:49:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:54,282 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 282 transitions. [2019-12-07 11:49:54,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 282 transitions. [2019-12-07 11:49:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:49:54,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:54,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:54,283 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1764835757, now seen corresponding path program 1 times [2019-12-07 11:49:54,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:54,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105575060] [2019-12-07 11:49:54,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:54,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105575060] [2019-12-07 11:49:54,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:54,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:49:54,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261025564] [2019-12-07 11:49:54,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:54,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:54,364 INFO L87 Difference]: Start difference. First operand 227 states and 282 transitions. Second operand 8 states. [2019-12-07 11:49:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:54,500 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2019-12-07 11:49:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:49:54,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 11:49:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:54,501 INFO L225 Difference]: With dead ends: 297 [2019-12-07 11:49:54,501 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 11:49:54,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:49:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 11:49:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 236. [2019-12-07 11:49:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 11:49:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 293 transitions. [2019-12-07 11:49:54,512 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 293 transitions. Word has length 22 [2019-12-07 11:49:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:54,512 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 293 transitions. [2019-12-07 11:49:54,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 293 transitions. [2019-12-07 11:49:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:49:54,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:54,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:54,513 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1229309041, now seen corresponding path program 1 times [2019-12-07 11:49:54,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:54,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140443221] [2019-12-07 11:49:54,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:54,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140443221] [2019-12-07 11:49:54,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:54,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:49:54,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457502374] [2019-12-07 11:49:54,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:54,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:54,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:54,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:54,647 INFO L87 Difference]: Start difference. First operand 236 states and 293 transitions. Second operand 8 states. [2019-12-07 11:49:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:54,973 INFO L93 Difference]: Finished difference Result 450 states and 547 transitions. [2019-12-07 11:49:54,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:49:54,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 11:49:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:54,975 INFO L225 Difference]: With dead ends: 450 [2019-12-07 11:49:54,975 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 11:49:54,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:49:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 11:49:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 275. [2019-12-07 11:49:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-07 11:49:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 342 transitions. [2019-12-07 11:49:54,987 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 342 transitions. Word has length 22 [2019-12-07 11:49:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:54,988 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 342 transitions. [2019-12-07 11:49:54,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 342 transitions. [2019-12-07 11:49:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:49:54,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:54,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:54,988 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:54,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1239889621, now seen corresponding path program 1 times [2019-12-07 11:49:54,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:54,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549344627] [2019-12-07 11:49:54,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:55,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549344627] [2019-12-07 11:49:55,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:55,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:49:55,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752449522] [2019-12-07 11:49:55,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:55,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:55,074 INFO L87 Difference]: Start difference. First operand 275 states and 342 transitions. Second operand 8 states. [2019-12-07 11:49:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:55,194 INFO L93 Difference]: Finished difference Result 315 states and 375 transitions. [2019-12-07 11:49:55,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:49:55,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 11:49:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:55,196 INFO L225 Difference]: With dead ends: 315 [2019-12-07 11:49:55,196 INFO L226 Difference]: Without dead ends: 247 [2019-12-07 11:49:55,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:49:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-07 11:49:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 214. [2019-12-07 11:49:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 11:49:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 266 transitions. [2019-12-07 11:49:55,206 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 266 transitions. Word has length 22 [2019-12-07 11:49:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:55,206 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 266 transitions. [2019-12-07 11:49:55,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 266 transitions. [2019-12-07 11:49:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:49:55,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:55,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:55,207 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:55,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:55,207 INFO L82 PathProgramCache]: Analyzing trace with hash -793996475, now seen corresponding path program 1 times [2019-12-07 11:49:55,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:55,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696734017] [2019-12-07 11:49:55,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:55,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696734017] [2019-12-07 11:49:55,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:55,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:49:55,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562922134] [2019-12-07 11:49:55,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:55,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:55,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:55,266 INFO L87 Difference]: Start difference. First operand 214 states and 266 transitions. Second operand 8 states. [2019-12-07 11:49:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:55,405 INFO L93 Difference]: Finished difference Result 274 states and 326 transitions. [2019-12-07 11:49:55,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:49:55,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-07 11:49:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:55,407 INFO L225 Difference]: With dead ends: 274 [2019-12-07 11:49:55,407 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 11:49:55,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:49:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 11:49:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 214. [2019-12-07 11:49:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 11:49:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 264 transitions. [2019-12-07 11:49:55,421 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 264 transitions. Word has length 24 [2019-12-07 11:49:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:55,421 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 264 transitions. [2019-12-07 11:49:55,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 264 transitions. [2019-12-07 11:49:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:49:55,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:55,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:55,422 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:55,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:55,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1968302766, now seen corresponding path program 1 times [2019-12-07 11:49:55,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:55,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298753636] [2019-12-07 11:49:55,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:55,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298753636] [2019-12-07 11:49:55,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:55,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:49:55,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749746054] [2019-12-07 11:49:55,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:55,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:55,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:55,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:55,558 INFO L87 Difference]: Start difference. First operand 214 states and 264 transitions. Second operand 8 states. [2019-12-07 11:49:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:55,824 INFO L93 Difference]: Finished difference Result 321 states and 389 transitions. [2019-12-07 11:49:55,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:49:55,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-07 11:49:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:55,825 INFO L225 Difference]: With dead ends: 321 [2019-12-07 11:49:55,825 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 11:49:55,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:49:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 11:49:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 214. [2019-12-07 11:49:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 11:49:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 263 transitions. [2019-12-07 11:49:55,835 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 263 transitions. Word has length 24 [2019-12-07 11:49:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:55,836 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 263 transitions. [2019-12-07 11:49:55,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 263 transitions. [2019-12-07 11:49:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:49:55,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:55,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:55,836 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash -339645636, now seen corresponding path program 1 times [2019-12-07 11:49:55,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:55,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125422622] [2019-12-07 11:49:55,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:55,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125422622] [2019-12-07 11:49:55,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:55,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:49:55,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547610105] [2019-12-07 11:49:55,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:55,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:55,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:55,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:55,915 INFO L87 Difference]: Start difference. First operand 214 states and 263 transitions. Second operand 8 states. [2019-12-07 11:49:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:56,199 INFO L93 Difference]: Finished difference Result 468 states and 516 transitions. [2019-12-07 11:49:56,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:49:56,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-07 11:49:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:56,201 INFO L225 Difference]: With dead ends: 468 [2019-12-07 11:49:56,201 INFO L226 Difference]: Without dead ends: 401 [2019-12-07 11:49:56,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:49:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-12-07 11:49:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 211. [2019-12-07 11:49:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-07 11:49:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 256 transitions. [2019-12-07 11:49:56,212 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 256 transitions. Word has length 24 [2019-12-07 11:49:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:56,212 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 256 transitions. [2019-12-07 11:49:56,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 256 transitions. [2019-12-07 11:49:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:49:56,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:56,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:56,213 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1530835845, now seen corresponding path program 1 times [2019-12-07 11:49:56,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:56,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13760801] [2019-12-07 11:49:56,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:56,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13760801] [2019-12-07 11:49:56,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:56,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:49:56,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51126254] [2019-12-07 11:49:56,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:49:56,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:56,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:49:56,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:56,300 INFO L87 Difference]: Start difference. First operand 211 states and 256 transitions. Second operand 8 states. [2019-12-07 11:49:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:56,443 INFO L93 Difference]: Finished difference Result 244 states and 289 transitions. [2019-12-07 11:49:56,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:49:56,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-07 11:49:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:56,445 INFO L225 Difference]: With dead ends: 244 [2019-12-07 11:49:56,445 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 11:49:56,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:49:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 11:49:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2019-12-07 11:49:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-07 11:49:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2019-12-07 11:49:56,455 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 26 [2019-12-07 11:49:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:56,455 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2019-12-07 11:49:56,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:49:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2019-12-07 11:49:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:49:56,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:56,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:56,456 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:49:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1696098322, now seen corresponding path program 1 times [2019-12-07 11:49:56,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:56,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541763496] [2019-12-07 11:49:56,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:49:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:49:56,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:49:56,490 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:49:56,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:49:56 BoogieIcfgContainer [2019-12-07 11:49:56,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:49:56,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:49:56,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:49:56,511 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:49:56,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:52" (3/4) ... [2019-12-07 11:49:56,514 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:49:56,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:49:56,515 INFO L168 Benchmark]: Toolchain (without parser) took 4783.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -129.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:56,515 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:56,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:56,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:56,516 INFO L168 Benchmark]: Boogie Preprocessor took 23.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:56,517 INFO L168 Benchmark]: RCFGBuilder took 349.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:56,517 INFO L168 Benchmark]: TraceAbstraction took 4135.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -28.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:56,517 INFO L168 Benchmark]: Witness Printer took 3.08 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-12-07 11:49:56,519 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 349.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4135.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -28.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.08 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 101. Possible FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add1 ; [L223] unsigned int r_add2 ; [L224] unsigned int zero ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int __retres14 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L231] zero = base2flt(0, 0) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] EXPR e + 128 [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L232] a = base2flt(ma, ea) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND TRUE m >= 1U << 25U [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U [L70] return (__retres4); [L233] b = base2flt(mb, eb) [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; [L84] COND TRUE a < b [L85] tmp = a [L86] a = b [L87] b = tmp [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] EXPR (int )(a >> 24U) - 128 [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 38 error locations. Result: UNSAFE, OverallTime: 4.0s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2923 SDtfs, 3887 SDslu, 7545 SDs, 0 SdLazy, 1873 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 1720 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 26586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...