./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9f16087843ad8a83da47d6a6a4e9d674fa79150d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:40:28,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:40:28,990 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:40:28,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:40:28,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:40:28,997 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:40:28,998 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:40:28,998 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:40:28,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:40:29,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:40:29,000 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:40:29,001 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:40:29,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:40:29,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:40:29,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:40:29,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:40:29,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:40:29,005 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:40:29,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:40:29,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:40:29,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:40:29,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:40:29,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:40:29,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:40:29,009 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:40:29,010 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:40:29,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:40:29,011 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:40:29,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:40:29,012 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:40:29,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:40:29,013 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:40:29,013 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:40:29,013 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:40:29,014 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:40:29,014 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:40:29,014 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 01:40:29,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:40:29,022 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:40:29,023 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:40:29,023 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 01:40:29,023 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 01:40:29,023 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 01:40:29,023 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 01:40:29,023 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 01:40:29,023 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 01:40:29,024 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 01:40:29,024 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 01:40:29,024 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:40:29,024 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:40:29,025 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:40:29,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:40:29,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:40:29,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:40:29,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:40:29,026 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 01:40:29,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:40:29,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:40:29,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:40:29,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:40:29,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:40:29,026 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:40:29,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:40:29,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:40:29,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:40:29,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:40:29,027 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 01:40:29,027 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:40:29,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 01:40:29,027 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 01:40:29,028 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f16087843ad8a83da47d6a6a4e9d674fa79150d [2018-11-10 01:40:29,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:40:29,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:40:29,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:40:29,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:40:29,062 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:40:29,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2018-11-10 01:40:29,099 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/data/c76795a78/1b25cb168f8f4fcca3adca1eaacfa783/FLAGa8b53b87d [2018-11-10 01:40:29,492 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:40:29,493 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2018-11-10 01:40:29,498 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/data/c76795a78/1b25cb168f8f4fcca3adca1eaacfa783/FLAGa8b53b87d [2018-11-10 01:40:29,507 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/data/c76795a78/1b25cb168f8f4fcca3adca1eaacfa783 [2018-11-10 01:40:29,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:40:29,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:40:29,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:40:29,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:40:29,513 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:40:29,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc2202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29, skipping insertion in model container [2018-11-10 01:40:29,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:40:29,532 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:40:29,630 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:40:29,633 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:40:29,643 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:40:29,653 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:40:29,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29 WrapperNode [2018-11-10 01:40:29,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:40:29,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:40:29,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:40:29,654 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:40:29,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:40:29,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:40:29,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:40:29,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:40:29,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... [2018-11-10 01:40:29,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:40:29,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:40:29,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:40:29,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:40:29,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/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 [2018-11-10 01:40:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:40:29,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:40:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:40:29,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:40:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:40:29,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:40:29,878 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:40:29,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:40:29 BoogieIcfgContainer [2018-11-10 01:40:29,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:40:29,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:40:29,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:40:29,882 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:40:29,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:40:29" (1/3) ... [2018-11-10 01:40:29,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b9044f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:40:29, skipping insertion in model container [2018-11-10 01:40:29,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:40:29" (2/3) ... [2018-11-10 01:40:29,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b9044f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:40:29, skipping insertion in model container [2018-11-10 01:40:29,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:40:29" (3/3) ... [2018-11-10 01:40:29,885 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2018-11-10 01:40:29,893 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:40:29,899 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2018-11-10 01:40:29,911 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2018-11-10 01:40:29,936 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:40:29,936 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:40:29,936 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:40:29,936 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:40:29,936 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:40:29,936 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:40:29,936 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:40:29,937 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:40:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-10 01:40:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 01:40:29,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:40:29,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:40:29,957 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:40:29,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:40:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash -619454321, now seen corresponding path program 1 times [2018-11-10 01:40:29,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:40:30,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:40:30,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:40:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:40:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:40:30,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:40:30,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:40:30,043 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:40:30,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 01:40:30,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 01:40:30,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:40:30,055 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-10 01:40:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:40:30,068 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-10 01:40:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 01:40:30,069 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-10 01:40:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:40:30,075 INFO L225 Difference]: With dead ends: 75 [2018-11-10 01:40:30,075 INFO L226 Difference]: Without dead ends: 35 [2018-11-10 01:40:30,077 INFO L605 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 [2018-11-10 01:40:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-10 01:40:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 01:40:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 01:40:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-10 01:40:30,099 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 9 [2018-11-10 01:40:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:40:30,099 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-10 01:40:30,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 01:40:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-10 01:40:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 01:40:30,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:40:30,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:40:30,101 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:40:30,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:40:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2023250361, now seen corresponding path program 1 times [2018-11-10 01:40:30,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:40:30,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:40:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:40:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:40:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:40:30,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:40:30,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:40:30,144 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:40:30,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:40:30,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:40:30,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:40:30,146 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2018-11-10 01:40:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:40:30,201 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-10 01:40:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:40:30,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 01:40:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:40:30,203 INFO L225 Difference]: With dead ends: 56 [2018-11-10 01:40:30,204 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 01:40:30,204 INFO L605 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 [2018-11-10 01:40:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 01:40:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2018-11-10 01:40:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 01:40:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-10 01:40:30,210 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 10 [2018-11-10 01:40:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:40:30,210 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-10 01:40:30,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:40:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-10 01:40:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 01:40:30,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:40:30,211 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:40:30,211 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:40:30,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:40:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1703748338, now seen corresponding path program 1 times [2018-11-10 01:40:30,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:40:30,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:40:30,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:40:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:40:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:40:30,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:40:30,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:40:30,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:40:30,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:40:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:40:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:40:30,232 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 3 states. [2018-11-10 01:40:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:40:30,265 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-10 01:40:30,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:40:30,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 01:40:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:40:30,266 INFO L225 Difference]: With dead ends: 46 [2018-11-10 01:40:30,266 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 01:40:30,267 INFO L605 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 [2018-11-10 01:40:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 01:40:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 01:40:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 01:40:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-11-10 01:40:30,271 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 11 [2018-11-10 01:40:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:40:30,271 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-10 01:40:30,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:40:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-10 01:40:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 01:40:30,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:40:30,272 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:40:30,273 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:40:30,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:40:30,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1703749492, now seen corresponding path program 1 times [2018-11-10 01:40:30,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:40:30,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:40:30,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:40:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:40:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:40:30,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:40:30,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:40:30,285 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:40:30,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:40:30,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:40:30,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:40:30,285 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 3 states. [2018-11-10 01:40:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:40:30,335 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-10 01:40:30,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:40:30,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 01:40:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:40:30,336 INFO L225 Difference]: With dead ends: 43 [2018-11-10 01:40:30,336 INFO L226 Difference]: Without dead ends: 42 [2018-11-10 01:40:30,336 INFO L605 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 [2018-11-10 01:40:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-10 01:40:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-10 01:40:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 01:40:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-11-10 01:40:30,339 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 11 [2018-11-10 01:40:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:40:30,339 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-10 01:40:30,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:40:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-10 01:40:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 01:40:30,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:40:30,340 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:40:30,340 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:40:30,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:40:30,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1703749300, now seen corresponding path program 1 times [2018-11-10 01:40:30,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:40:30,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:40:30,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:40:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:40:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:40:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:40:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:40:30,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:40:30,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:40:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:40:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:40:30,371 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 4 states. [2018-11-10 01:40:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:40:30,479 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-10 01:40:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:40:30,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-10 01:40:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:40:30,480 INFO L225 Difference]: With dead ends: 64 [2018-11-10 01:40:30,480 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 01:40:30,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:40:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 01:40:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-10 01:40:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 01:40:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-10 01:40:30,485 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 11 [2018-11-10 01:40:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:40:30,486 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-10 01:40:30,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:40:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-10 01:40:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 01:40:30,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:40:30,486 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:40:30,487 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:40:30,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:40:30,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1276591017, now seen corresponding path program 1 times [2018-11-10 01:40:30,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:40:30,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:40:30,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:40:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:40:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:40:30,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:40:30,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:40:30,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:40:30,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:40:30,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:40:30,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:40:30,506 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 3 states. [2018-11-10 01:40:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:40:30,530 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2018-11-10 01:40:30,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:40:30,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 01:40:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:40:30,531 INFO L225 Difference]: With dead ends: 65 [2018-11-10 01:40:30,531 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 01:40:30,531 INFO L605 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 [2018-11-10 01:40:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 01:40:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-11-10 01:40:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 01:40:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-10 01:40:30,535 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 12 [2018-11-10 01:40:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:40:30,536 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-10 01:40:30,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:40:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-10 01:40:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 01:40:30,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:40:30,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:40:30,536 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:40:30,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:40:30,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1276626767, now seen corresponding path program 1 times [2018-11-10 01:40:30,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:40:30,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:40:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:40:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:40:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:40:30,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:40:30,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:40:30,551 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:40:30,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:40:30,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:40:30,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:40:30,552 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 3 states. [2018-11-10 01:40:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:40:30,585 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-10 01:40:30,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:40:30,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 01:40:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:40:30,586 INFO L225 Difference]: With dead ends: 54 [2018-11-10 01:40:30,586 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 01:40:30,587 INFO L605 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 [2018-11-10 01:40:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 01:40:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-10 01:40:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 01:40:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-10 01:40:30,592 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 12 [2018-11-10 01:40:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:40:30,593 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-10 01:40:30,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:40:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-10 01:40:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 01:40:30,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:40:30,593 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:40:30,594 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:40:30,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:40:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash 919615956, now seen corresponding path program 1 times [2018-11-10 01:40:30,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:40:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:40:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:40:30,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:40:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:40:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:40:30,615 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 01:40:30,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:40:30 BoogieIcfgContainer [2018-11-10 01:40:30,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:40:30,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:40:30,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:40:30,629 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:40:30,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:40:29" (3/4) ... [2018-11-10 01:40:30,631 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 01:40:30,654 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05be0f7d-7a12-4ad3-88dd-33084a2e8baa/bin-2019/utaipan/witness.graphml [2018-11-10 01:40:30,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:40:30,655 INFO L168 Benchmark]: Toolchain (without parser) took 1144.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 960.3 MB in the beginning and 1.0 GB in the end (delta: -80.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:40:30,656 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:40:30,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.94 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:40:30,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.60 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:40:30,657 INFO L168 Benchmark]: Boogie Preprocessor took 17.37 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:40:30,657 INFO L168 Benchmark]: RCFGBuilder took 193.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 01:40:30,659 INFO L168 Benchmark]: TraceAbstraction took 749.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.5 MB). Peak memory consumption was 86.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:40:30,660 INFO L168 Benchmark]: Witness Printer took 25.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:40:30,661 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.94 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.60 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.37 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 749.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.5 MB). Peak memory consumption was 86.5 MB. Max. memory is 11.5 GB. * Witness Printer took 25.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 30]: integer overflow possible integer overflow possible We found a FailurePath: [L13] int a, b; [L14] a = __VERIFIER_nondet_int() [L15] b = __VERIFIER_nondet_int() [L16] COND TRUE a < 30 VAL [a=-2147483639, b=-2147483639] [L17] COND FALSE !(b < a) VAL [a=-2147483639, b=-2147483639] [L29] EXPR a + 2 [L29] a = a + 2 VAL [a=-2147483637, b=-2147483639] [L30] b - 10 VAL [a=-2147483637, b=-2147483639] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 40 locations, 12 error locations. UNSAFE Result, 0.7s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 107 SDslu, 82 SDs, 0 SdLazy, 154 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 1543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...