./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label08.c -s /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16d1e07abe3d8baa61b9a8d494202a7664f873bb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:18:24,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:18:24,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:18:24,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:18:24,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:18:24,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:18:24,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:18:24,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:18:24,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:18:24,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:18:24,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:18:24,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:18:24,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:18:24,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:18:24,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:18:24,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:18:24,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:18:24,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:18:24,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:18:24,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:18:24,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:18:24,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:18:24,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:18:24,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:18:24,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:18:24,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:18:24,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:18:24,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:18:24,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:18:24,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:18:24,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:18:24,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:18:24,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:18:24,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:18:24,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:18:24,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:18:24,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:18:24,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:18:24,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:18:24,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:18:24,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:18:24,938 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:18:24,951 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:18:24,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:18:24,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:18:24,952 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:18:24,952 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:18:24,952 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:18:24,952 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:18:24,952 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:18:24,953 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:18:24,953 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:18:24,953 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:18:24,953 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:18:24,953 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:18:24,954 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:18:24,954 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:18:24,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:18:24,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:18:24,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:18:24,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:18:24,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:18:24,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:18:24,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:18:24,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:18:24,956 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:18:24,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:18:24,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:18:24,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:18:24,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:18:24,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:18:24,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:18:24,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:18:24,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:18:24,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:18:24,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:18:24,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:18:24,958 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:18:24,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:18:24,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:18:24,958 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:18:24,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:18:24,959 INFO L138 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/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16d1e07abe3d8baa61b9a8d494202a7664f873bb [2019-12-07 12:18:25,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:18:25,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:18:25,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:18:25,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:18:25,097 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:18:25,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label08.c [2019-12-07 12:18:25,144 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/data/d4c42b457/917b8dec1f7b4615b79aec88de030d2a/FLAGd92365dd9 [2019-12-07 12:18:25,577 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:18:25,577 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/sv-benchmarks/c/eca-rers2012/Problem01_label08.c [2019-12-07 12:18:25,586 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/data/d4c42b457/917b8dec1f7b4615b79aec88de030d2a/FLAGd92365dd9 [2019-12-07 12:18:25,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/data/d4c42b457/917b8dec1f7b4615b79aec88de030d2a [2019-12-07 12:18:25,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:18:25,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:18:25,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:18:25,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:18:25,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:18:25,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:18:25" (1/1) ... [2019-12-07 12:18:25,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9a3eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:25, skipping insertion in model container [2019-12-07 12:18:25,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:18:25" (1/1) ... [2019-12-07 12:18:25,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:18:25,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:18:26,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:18:26,225 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:18:26,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:18:26,292 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:18:26,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26 WrapperNode [2019-12-07 12:18:26,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:18:26,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:18:26,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:18:26,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:18:26,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:18:26,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:18:26,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:18:26,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:18:26,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... [2019-12-07 12:18:26,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:18:26,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:18:26,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:18:26,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:18:26,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/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 [2019-12-07 12:18:26,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:18:26,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:18:27,526 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:18:27,526 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:18:27,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:18:27 BoogieIcfgContainer [2019-12-07 12:18:27,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:18:27,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:18:27,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:18:27,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:18:27,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:18:25" (1/3) ... [2019-12-07 12:18:27,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307a9857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:18:27, skipping insertion in model container [2019-12-07 12:18:27,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:18:26" (2/3) ... [2019-12-07 12:18:27,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307a9857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:18:27, skipping insertion in model container [2019-12-07 12:18:27,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:18:27" (3/3) ... [2019-12-07 12:18:27,535 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label08.c [2019-12-07 12:18:27,542 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:18:27,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:18:27,555 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:18:27,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:18:27,574 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:18:27,574 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:18:27,574 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:18:27,574 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:18:27,574 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:18:27,575 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:18:27,575 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:18:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 12:18:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:18:27,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:27,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:18:27,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:27,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash -839558106, now seen corresponding path program 1 times [2019-12-07 12:18:27,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:27,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771923278] [2019-12-07 12:18:27,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:27,830 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 12:18:27,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771923278] [2019-12-07 12:18:27,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:27,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:18:27,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676028269] [2019-12-07 12:18:27,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:18:27,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:18:27,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:18:27,847 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-12-07 12:18:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:28,176 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-12-07 12:18:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:18:28,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 12:18:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:28,188 INFO L225 Difference]: With dead ends: 224 [2019-12-07 12:18:28,188 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 12:18:28,190 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 12:18:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 12:18:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-12-07 12:18:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 12:18:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 253 transitions. [2019-12-07 12:18:28,230 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 253 transitions. Word has length 71 [2019-12-07 12:18:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:28,230 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 253 transitions. [2019-12-07 12:18:28,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:18:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 253 transitions. [2019-12-07 12:18:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 12:18:28,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:28,234 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:18:28,234 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 262564574, now seen corresponding path program 1 times [2019-12-07 12:18:28,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:28,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657504041] [2019-12-07 12:18:28,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:18:28,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657504041] [2019-12-07 12:18:28,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:28,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:18:28,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845296180] [2019-12-07 12:18:28,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:18:28,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:28,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:18:28,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:18:28,314 INFO L87 Difference]: Start difference. First operand 145 states and 253 transitions. Second operand 4 states. [2019-12-07 12:18:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:28,626 INFO L93 Difference]: Finished difference Result 573 states and 1007 transitions. [2019-12-07 12:18:28,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:18:28,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 12:18:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:28,630 INFO L225 Difference]: With dead ends: 573 [2019-12-07 12:18:28,630 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 12:18:28,631 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 12:18:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 12:18:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 287. [2019-12-07 12:18:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-12-07 12:18:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2019-12-07 12:18:28,646 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 75 [2019-12-07 12:18:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:28,647 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2019-12-07 12:18:28,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:18:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2019-12-07 12:18:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 12:18:28,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:28,651 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:28,651 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash 406857172, now seen corresponding path program 1 times [2019-12-07 12:18:28,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:28,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012124177] [2019-12-07 12:18:28,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:18:28,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012124177] [2019-12-07 12:18:28,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:28,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:18:28,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064565430] [2019-12-07 12:18:28,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:18:28,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:18:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:18:28,711 INFO L87 Difference]: Start difference. First operand 287 states and 467 transitions. Second operand 3 states. [2019-12-07 12:18:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:28,950 INFO L93 Difference]: Finished difference Result 715 states and 1184 transitions. [2019-12-07 12:18:28,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:18:28,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 12:18:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:28,952 INFO L225 Difference]: With dead ends: 715 [2019-12-07 12:18:28,952 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 12:18:28,954 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 12:18:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 12:18:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-12-07 12:18:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 12:18:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-12-07 12:18:28,966 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 105 [2019-12-07 12:18:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:28,967 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-12-07 12:18:28,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:18:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-12-07 12:18:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 12:18:28,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:28,969 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:28,969 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash 175522078, now seen corresponding path program 1 times [2019-12-07 12:18:28,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:28,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087542103] [2019-12-07 12:18:28,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:18:29,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087542103] [2019-12-07 12:18:29,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:29,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:18:29,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038132641] [2019-12-07 12:18:29,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:18:29,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:18:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:18:29,072 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 5 states. [2019-12-07 12:18:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:29,403 INFO L93 Difference]: Finished difference Result 788 states and 1270 transitions. [2019-12-07 12:18:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:18:29,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-12-07 12:18:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:29,405 INFO L225 Difference]: With dead ends: 788 [2019-12-07 12:18:29,405 INFO L226 Difference]: Without dead ends: 431 [2019-12-07 12:18:29,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:18:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-07 12:18:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2019-12-07 12:18:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 12:18:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 664 transitions. [2019-12-07 12:18:29,416 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 664 transitions. Word has length 109 [2019-12-07 12:18:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:29,416 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 664 transitions. [2019-12-07 12:18:29,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:18:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 664 transitions. [2019-12-07 12:18:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 12:18:29,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:29,418 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:29,418 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash 94275030, now seen corresponding path program 1 times [2019-12-07 12:18:29,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:29,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499717003] [2019-12-07 12:18:29,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 12:18:29,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499717003] [2019-12-07 12:18:29,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:29,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:18:29,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381266013] [2019-12-07 12:18:29,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:18:29,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:29,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:18:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:18:29,460 INFO L87 Difference]: Start difference. First operand 429 states and 664 transitions. Second operand 3 states. [2019-12-07 12:18:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:29,675 INFO L93 Difference]: Finished difference Result 928 states and 1464 transitions. [2019-12-07 12:18:29,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:18:29,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-12-07 12:18:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:29,678 INFO L225 Difference]: With dead ends: 928 [2019-12-07 12:18:29,678 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 12:18:29,679 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 12:18:29,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 12:18:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-12-07 12:18:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 12:18:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 842 transitions. [2019-12-07 12:18:29,692 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 842 transitions. Word has length 113 [2019-12-07 12:18:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:29,693 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 842 transitions. [2019-12-07 12:18:29,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:18:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 842 transitions. [2019-12-07 12:18:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 12:18:29,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:29,695 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:18:29,695 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:29,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:29,695 INFO L82 PathProgramCache]: Analyzing trace with hash 927110326, now seen corresponding path program 1 times [2019-12-07 12:18:29,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:29,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065086496] [2019-12-07 12:18:29,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:18:29,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065086496] [2019-12-07 12:18:29,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:29,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:18:29,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19779605] [2019-12-07 12:18:29,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:18:29,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:29,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:18:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:18:29,750 INFO L87 Difference]: Start difference. First operand 571 states and 842 transitions. Second operand 4 states. [2019-12-07 12:18:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:30,134 INFO L93 Difference]: Finished difference Result 1709 states and 2533 transitions. [2019-12-07 12:18:30,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:18:30,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 12:18:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:30,139 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 12:18:30,139 INFO L226 Difference]: Without dead ends: 1210 [2019-12-07 12:18:30,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 12:18:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-12-07 12:18:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 855. [2019-12-07 12:18:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 12:18:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1222 transitions. [2019-12-07 12:18:30,156 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1222 transitions. Word has length 122 [2019-12-07 12:18:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:30,157 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1222 transitions. [2019-12-07 12:18:30,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:18:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1222 transitions. [2019-12-07 12:18:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 12:18:30,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:30,159 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:18:30,159 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:30,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1551429574, now seen corresponding path program 1 times [2019-12-07 12:18:30,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:30,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405615136] [2019-12-07 12:18:30,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 12:18:30,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405615136] [2019-12-07 12:18:30,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:30,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:18:30,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201794837] [2019-12-07 12:18:30,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:18:30,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:30,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:18:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:18:30,205 INFO L87 Difference]: Start difference. First operand 855 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:18:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:30,531 INFO L93 Difference]: Finished difference Result 1638 states and 2366 transitions. [2019-12-07 12:18:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:18:30,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 12:18:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:30,535 INFO L225 Difference]: With dead ends: 1638 [2019-12-07 12:18:30,535 INFO L226 Difference]: Without dead ends: 855 [2019-12-07 12:18:30,536 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 12:18:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-12-07 12:18:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-12-07 12:18:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 12:18:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1216 transitions. [2019-12-07 12:18:30,550 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1216 transitions. Word has length 146 [2019-12-07 12:18:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:30,551 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1216 transitions. [2019-12-07 12:18:30,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:18:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1216 transitions. [2019-12-07 12:18:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 12:18:30,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:30,553 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:18:30,553 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1130225127, now seen corresponding path program 1 times [2019-12-07 12:18:30,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:30,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202041463] [2019-12-07 12:18:30,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 12:18:30,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202041463] [2019-12-07 12:18:30,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:30,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:18:30,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95817702] [2019-12-07 12:18:30,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:18:30,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:18:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:18:30,706 INFO L87 Difference]: Start difference. First operand 855 states and 1216 transitions. Second operand 8 states. [2019-12-07 12:18:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:31,241 INFO L93 Difference]: Finished difference Result 1890 states and 2678 transitions. [2019-12-07 12:18:31,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:18:31,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-12-07 12:18:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:31,247 INFO L225 Difference]: With dead ends: 1890 [2019-12-07 12:18:31,248 INFO L226 Difference]: Without dead ends: 1107 [2019-12-07 12:18:31,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:18:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-12-07 12:18:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 997. [2019-12-07 12:18:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 12:18:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1375 transitions. [2019-12-07 12:18:31,274 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1375 transitions. Word has length 158 [2019-12-07 12:18:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:31,275 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1375 transitions. [2019-12-07 12:18:31,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:18:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1375 transitions. [2019-12-07 12:18:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 12:18:31,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:31,278 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:18:31,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash -397130838, now seen corresponding path program 1 times [2019-12-07 12:18:31,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:31,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8428678] [2019-12-07 12:18:31,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 12:18:31,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8428678] [2019-12-07 12:18:31,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:31,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:18:31,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542230890] [2019-12-07 12:18:31,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:18:31,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:18:31,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:18:31,342 INFO L87 Difference]: Start difference. First operand 997 states and 1375 transitions. Second operand 4 states. [2019-12-07 12:18:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:31,660 INFO L93 Difference]: Finished difference Result 2348 states and 3224 transitions. [2019-12-07 12:18:31,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:18:31,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 12:18:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:31,665 INFO L225 Difference]: With dead ends: 2348 [2019-12-07 12:18:31,665 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 12:18:31,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 12:18:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 12:18:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-12-07 12:18:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 12:18:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1057 transitions. [2019-12-07 12:18:31,687 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1057 transitions. Word has length 161 [2019-12-07 12:18:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:31,687 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1057 transitions. [2019-12-07 12:18:31,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:18:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1057 transitions. [2019-12-07 12:18:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 12:18:31,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:18:31,691 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:18:31,691 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:18:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:18:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1210199784, now seen corresponding path program 1 times [2019-12-07 12:18:31,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:18:31,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699797094] [2019-12-07 12:18:31,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:18:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:18:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-12-07 12:18:31,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699797094] [2019-12-07 12:18:31,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:18:31,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:18:31,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632124055] [2019-12-07 12:18:31,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:18:31,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:18:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:18:31,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:18:31,775 INFO L87 Difference]: Start difference. First operand 926 states and 1057 transitions. Second operand 3 states. [2019-12-07 12:18:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:18:31,944 INFO L93 Difference]: Finished difference Result 1139 states and 1309 transitions. [2019-12-07 12:18:31,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:18:31,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-12-07 12:18:31,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:18:31,945 INFO L225 Difference]: With dead ends: 1139 [2019-12-07 12:18:31,945 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:18:31,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:18:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:18:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:18:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:18:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:18:31,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2019-12-07 12:18:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:18:31,947 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:18:31,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:18:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:18:31,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:18:31,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:18:32,143 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 12:18:32,143 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 12:18:32,143 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 12:18:32,143 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 12:18:32,143 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 12:18:32,143 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 12:18:32,144 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 13 ~a8~0))) (let ((.cse4 (not .cse0)) (.cse5 (not (= ~a16~0 6))) (.cse2 (not (= 1 ~a7~0))) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 (= ~a17~0 1)) (and .cse5 .cse2 .cse3) (and (not (= 15 ~a8~0)) .cse3 .cse1)))) [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 12:18:32,145 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 12:18:32,146 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 12:18:32,147 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 12:18:32,147 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 12:18:32,147 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 12:18:32,147 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 13 ~a8~0))) (let ((.cse4 (not .cse0)) (.cse5 (not (= ~a16~0 6))) (.cse2 (not (= 1 ~a7~0))) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 (= ~a17~0 1)) (and .cse5 .cse2 .cse3) (and (not (= 15 ~a8~0)) .cse3 .cse1)))) [2019-12-07 12:18:32,147 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 12:18:32,147 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 12:18:32,147 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 12:18:32,147 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 12:18:32,147 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 12:18:32,148 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 12:18:32,149 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 12:18:32,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:18:32 BoogieIcfgContainer [2019-12-07 12:18:32,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:18:32,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:18:32,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:18:32,166 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:18:32,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:18:27" (3/4) ... [2019-12-07 12:18:32,169 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:18:32,186 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 12:18:32,188 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-12-07 12:18:32,189 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 12:18:32,190 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:18:32,287 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_725f55bd-3c02-4c5d-bd25-64981a775f1f/bin/utaipan/witness.graphml [2019-12-07 12:18:32,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:18:32,289 INFO L168 Benchmark]: Toolchain (without parser) took 6361.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.4 MB). Free memory was 936.0 MB in the beginning and 976.7 MB in the end (delta: -40.6 MB). Peak memory consumption was 216.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:18:32,290 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:18:32,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 936.0 MB in the beginning and 1.0 GB in the end (delta: -112.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:18:32,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:18:32,291 INFO L168 Benchmark]: Boogie Preprocessor took 41.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:18:32,291 INFO L168 Benchmark]: RCFGBuilder took 1142.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 821.9 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:18:32,291 INFO L168 Benchmark]: TraceAbstraction took 4636.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 821.9 MB in the beginning and 999.0 MB in the end (delta: -177.2 MB). Peak memory consumption was 572.8 kB. Max. memory is 11.5 GB. [2019-12-07 12:18:32,291 INFO L168 Benchmark]: Witness Printer took 122.02 ms. Allocated memory is still 1.3 GB. Free memory was 999.0 MB in the beginning and 976.7 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:18:32,293 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 936.0 MB in the beginning and 1.0 GB in the end (delta: -112.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1142.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 821.9 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4636.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 821.9 MB in the beginning and 999.0 MB in the end (delta: -177.2 MB). Peak memory consumption was 572.8 kB. Max. memory is 11.5 GB. * Witness Printer took 122.02 ms. Allocated memory is still 1.3 GB. Free memory was 999.0 MB in the beginning and 976.7 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 515]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((13 == a8 && a20 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((13 == a8 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((13 == a8 && a20 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((13 == a8 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 4.3s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 430 SDtfs, 1287 SDslu, 76 SDs, 0 SdLazy, 3199 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=8, 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, 10 MinimizatonAttempts, 822 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 47 NumberOfFragments, 133 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5286 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1235 NumberOfCodeBlocks, 1235 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1225 ConstructedInterpolants, 0 QuantifiedInterpolants, 394722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 761/761 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 proved your program to be correct! Received shutdown request...