./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label09.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_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c -s /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/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 31179e70784aebb46d762aef4da1a2ff63bbff38 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:54:24,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:54:24,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:54:24,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:54:24,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:54:24,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:54:24,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:54:24,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:54:24,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:54:24,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:54:24,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:54:24,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:54:24,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:54:24,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:54:25,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:54:25,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:54:25,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:54:25,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:54:25,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:54:25,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:54:25,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:54:25,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:54:25,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:54:25,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:54:25,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:54:25,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:54:25,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:54:25,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:54:25,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:54:25,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:54:25,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:54:25,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:54:25,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:54:25,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:54:25,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:54:25,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:54:25,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:54:25,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:54:25,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:54:25,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:54:25,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:54:25,015 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:54:25,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:54:25,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:54:25,026 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:54:25,026 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:54:25,027 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:54:25,027 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:54:25,027 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:54:25,027 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:54:25,027 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:54:25,027 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:54:25,027 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:54:25,027 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:54:25,028 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:54:25,028 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:54:25,028 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:54:25,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:54:25,029 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:54:25,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:54:25,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:54:25,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:54:25,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:54:25,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:54:25,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:54:25,029 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:54:25,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:54:25,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:54:25,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:54:25,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:54:25,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:54:25,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:54:25,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:54:25,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:54:25,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:54:25,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:54:25,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:54:25,031 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:54:25,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:54:25,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:54:25,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:54:25,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:54:25,032 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_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/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 -> 31179e70784aebb46d762aef4da1a2ff63bbff38 [2019-12-07 20:54:25,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:54:25,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:54:25,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:54:25,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:54:25,145 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:54:25,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2019-12-07 20:54:25,189 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/data/f600026f5/79fe1e7d1b3e43989c358f958e5fb61a/FLAGf67ef35a9 [2019-12-07 20:54:25,656 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:54:25,656 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2019-12-07 20:54:25,666 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/data/f600026f5/79fe1e7d1b3e43989c358f958e5fb61a/FLAGf67ef35a9 [2019-12-07 20:54:25,675 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/data/f600026f5/79fe1e7d1b3e43989c358f958e5fb61a [2019-12-07 20:54:25,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:54:25,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:54:25,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:54:25,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:54:25,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:54:25,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:54:25" (1/1) ... [2019-12-07 20:54:25,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:25, skipping insertion in model container [2019-12-07 20:54:25,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:54:25" (1/1) ... [2019-12-07 20:54:25,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:54:25,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:54:25,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:54:25,969 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:54:26,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:54:26,033 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:54:26,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26 WrapperNode [2019-12-07 20:54:26,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:54:26,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:54:26,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:54:26,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:54:26,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:54:26,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:54:26,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:54:26,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:54:26,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... [2019-12-07 20:54:26,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:54:26,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:54:26,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:54:26,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:54:26,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/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 20:54:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:54:26,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:54:27,177 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:54:27,177 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 20:54:27,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:54:27 BoogieIcfgContainer [2019-12-07 20:54:27,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:54:27,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:54:27,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:54:27,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:54:27,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:54:25" (1/3) ... [2019-12-07 20:54:27,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:54:27, skipping insertion in model container [2019-12-07 20:54:27,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:54:26" (2/3) ... [2019-12-07 20:54:27,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:54:27, skipping insertion in model container [2019-12-07 20:54:27,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:54:27" (3/3) ... [2019-12-07 20:54:27,186 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label09.c [2019-12-07 20:54:27,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:54:27,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:54:27,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:54:27,228 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:54:27,229 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:54:27,229 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:54:27,229 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:54:27,229 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:54:27,229 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:54:27,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:54:27,229 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:54:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 20:54:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 20:54:27,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:27,249 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 20:54:27,250 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:27,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1323232153, now seen corresponding path program 1 times [2019-12-07 20:54:27,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:27,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 20:54:27,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:27,516 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 20:54:27,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 20:54:27,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:27,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:54:27,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528924625] [2019-12-07 20:54:27,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:54:27,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:27,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:54:27,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:54:27,533 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 20:54:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:27,962 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 20:54:27,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:54:27,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 20:54:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:27,975 INFO L225 Difference]: With dead ends: 297 [2019-12-07 20:54:27,976 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 20:54:27,979 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 20:54:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 20:54:28,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-12-07 20:54:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 20:54:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-12-07 20:54:28,017 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-12-07 20:54:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:28,018 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-12-07 20:54:28,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:54:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-12-07 20:54:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 20:54:28,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:28,020 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:54:28,021 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1048384774, now seen corresponding path program 1 times [2019-12-07 20:54:28,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:28,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 20:54:28,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:54:28,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 20:54:28,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:28,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:54:28,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761129232] [2019-12-07 20:54:28,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:54:28,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:54:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:54:28,060 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-12-07 20:54:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:28,395 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-12-07 20:54:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:54:28,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 20:54:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:28,399 INFO L225 Difference]: With dead ends: 573 [2019-12-07 20:54:28,399 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 20:54:28,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 20:54:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 20:54:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 20:54:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 20:54:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-12-07 20:54:28,425 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-12-07 20:54:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:28,426 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-12-07 20:54:28,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:54:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-12-07 20:54:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 20:54:28,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:28,429 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:54:28,429 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2123289446, now seen corresponding path program 1 times [2019-12-07 20:54:28,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:28,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249357790] [2019-12-07 20:54:28,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:54:28,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249357790] [2019-12-07 20:54:28,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:28,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:54:28,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861051785] [2019-12-07 20:54:28,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:54:28,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:28,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:54:28,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:54:28,490 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-12-07 20:54:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:28,704 INFO L93 Difference]: Finished difference Result 1212 states and 1980 transitions. [2019-12-07 20:54:28,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:54:28,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-07 20:54:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:28,708 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 20:54:28,708 INFO L226 Difference]: Without dead ends: 784 [2019-12-07 20:54:28,709 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 20:54:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-07 20:54:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-12-07 20:54:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 20:54:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 955 transitions. [2019-12-07 20:54:28,727 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 955 transitions. Word has length 78 [2019-12-07 20:54:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:28,727 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 955 transitions. [2019-12-07 20:54:28,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:54:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 955 transitions. [2019-12-07 20:54:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 20:54:28,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:28,731 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:54:28,731 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:28,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2133664500, now seen corresponding path program 1 times [2019-12-07 20:54:28,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:28,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629201126] [2019-12-07 20:54:28,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:54:28,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629201126] [2019-12-07 20:54:28,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:28,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:54:28,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764773490] [2019-12-07 20:54:28,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:54:28,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:54:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:54:28,775 INFO L87 Difference]: Start difference. First operand 642 states and 955 transitions. Second operand 3 states. [2019-12-07 20:54:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:29,016 INFO L93 Difference]: Finished difference Result 1496 states and 2249 transitions. [2019-12-07 20:54:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:54:29,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-07 20:54:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:29,021 INFO L225 Difference]: With dead ends: 1496 [2019-12-07 20:54:29,021 INFO L226 Difference]: Without dead ends: 855 [2019-12-07 20:54:29,022 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 20:54:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-12-07 20:54:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 713. [2019-12-07 20:54:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-07 20:54:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1057 transitions. [2019-12-07 20:54:29,043 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1057 transitions. Word has length 94 [2019-12-07 20:54:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:29,044 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1057 transitions. [2019-12-07 20:54:29,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:54:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1057 transitions. [2019-12-07 20:54:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 20:54:29,046 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:29,046 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:54:29,046 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:29,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash 501983831, now seen corresponding path program 1 times [2019-12-07 20:54:29,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:29,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913859328] [2019-12-07 20:54:29,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 20:54:29,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913859328] [2019-12-07 20:54:29,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:29,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:54:29,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038132641] [2019-12-07 20:54:29,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:54:29,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:29,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:54:29,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:54:29,085 INFO L87 Difference]: Start difference. First operand 713 states and 1057 transitions. Second operand 3 states. [2019-12-07 20:54:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:29,327 INFO L93 Difference]: Finished difference Result 1780 states and 2618 transitions. [2019-12-07 20:54:29,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:54:29,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 20:54:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:29,333 INFO L225 Difference]: With dead ends: 1780 [2019-12-07 20:54:29,333 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 20:54:29,334 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 20:54:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 20:54:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-12-07 20:54:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 20:54:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1241 transitions. [2019-12-07 20:54:29,357 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1241 transitions. Word has length 105 [2019-12-07 20:54:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:29,357 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1241 transitions. [2019-12-07 20:54:29,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:54:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1241 transitions. [2019-12-07 20:54:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 20:54:29,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:29,359 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-12-07 20:54:29,360 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:29,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:29,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1784758293, now seen corresponding path program 1 times [2019-12-07 20:54:29,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:29,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650453578] [2019-12-07 20:54:29,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 20:54:29,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650453578] [2019-12-07 20:54:29,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:29,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:54:29,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824456744] [2019-12-07 20:54:29,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:54:29,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:29,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:54:29,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:54:29,434 INFO L87 Difference]: Start difference. First operand 855 states and 1241 transitions. Second operand 4 states. [2019-12-07 20:54:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:29,775 INFO L93 Difference]: Finished difference Result 1809 states and 2593 transitions. [2019-12-07 20:54:29,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:54:29,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 20:54:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:29,780 INFO L225 Difference]: With dead ends: 1809 [2019-12-07 20:54:29,781 INFO L226 Difference]: Without dead ends: 955 [2019-12-07 20:54:29,782 INFO L630 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 [2019-12-07 20:54:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-07 20:54:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 926. [2019-12-07 20:54:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 20:54:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1318 transitions. [2019-12-07 20:54:29,812 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1318 transitions. Word has length 113 [2019-12-07 20:54:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:29,813 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1318 transitions. [2019-12-07 20:54:29,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:54:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1318 transitions. [2019-12-07 20:54:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 20:54:29,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:29,826 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-12-07 20:54:29,826 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash 509280291, now seen corresponding path program 1 times [2019-12-07 20:54:29,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:29,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618236532] [2019-12-07 20:54:29,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 20:54:29,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618236532] [2019-12-07 20:54:29,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:29,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:54:29,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216683921] [2019-12-07 20:54:29,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:54:29,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:29,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:54:29,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:54:29,882 INFO L87 Difference]: Start difference. First operand 926 states and 1318 transitions. Second operand 4 states. [2019-12-07 20:54:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:30,206 INFO L93 Difference]: Finished difference Result 1780 states and 2558 transitions. [2019-12-07 20:54:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:54:30,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 20:54:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:30,210 INFO L225 Difference]: With dead ends: 1780 [2019-12-07 20:54:30,210 INFO L226 Difference]: Without dead ends: 926 [2019-12-07 20:54:30,211 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 20:54:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-12-07 20:54:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-12-07 20:54:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 20:54:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1312 transitions. [2019-12-07 20:54:30,227 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1312 transitions. Word has length 117 [2019-12-07 20:54:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:30,227 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1312 transitions. [2019-12-07 20:54:30,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:54:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1312 transitions. [2019-12-07 20:54:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 20:54:30,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:30,229 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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 20:54:30,229 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1638326758, now seen corresponding path program 1 times [2019-12-07 20:54:30,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:30,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536902846] [2019-12-07 20:54:30,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-07 20:54:30,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536902846] [2019-12-07 20:54:30,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:30,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:54:30,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818973036] [2019-12-07 20:54:30,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:54:30,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:54:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:54:30,333 INFO L87 Difference]: Start difference. First operand 926 states and 1312 transitions. Second operand 6 states. [2019-12-07 20:54:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:30,795 INFO L93 Difference]: Finished difference Result 2067 states and 2917 transitions. [2019-12-07 20:54:30,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:54:30,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-12-07 20:54:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:30,800 INFO L225 Difference]: With dead ends: 2067 [2019-12-07 20:54:30,800 INFO L226 Difference]: Without dead ends: 1213 [2019-12-07 20:54:30,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:54:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-12-07 20:54:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2019-12-07 20:54:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-07 20:54:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1465 transitions. [2019-12-07 20:54:30,819 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1465 transitions. Word has length 131 [2019-12-07 20:54:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:30,819 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1465 transitions. [2019-12-07 20:54:30,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:54:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1465 transitions. [2019-12-07 20:54:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 20:54:30,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:30,822 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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 20:54:30,822 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:30,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:30,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1291929313, now seen corresponding path program 1 times [2019-12-07 20:54:30,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:30,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789551579] [2019-12-07 20:54:30,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 20:54:30,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789551579] [2019-12-07 20:54:30,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:54:30,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:54:30,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982917393] [2019-12-07 20:54:30,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:54:30,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:30,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:54:30,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:54:30,884 INFO L87 Difference]: Start difference. First operand 1068 states and 1465 transitions. Second operand 4 states. [2019-12-07 20:54:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:31,225 INFO L93 Difference]: Finished difference Result 2845 states and 3881 transitions. [2019-12-07 20:54:31,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:54:31,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 20:54:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:31,230 INFO L225 Difference]: With dead ends: 2845 [2019-12-07 20:54:31,230 INFO L226 Difference]: Without dead ends: 1352 [2019-12-07 20:54:31,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 20:54:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-12-07 20:54:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1139. [2019-12-07 20:54:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-12-07 20:54:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1313 transitions. [2019-12-07 20:54:31,249 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1313 transitions. Word has length 134 [2019-12-07 20:54:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:31,250 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1313 transitions. [2019-12-07 20:54:31,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:54:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1313 transitions. [2019-12-07 20:54:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 20:54:31,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:54:31,252 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:54:31,252 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:54:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:54:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2055484374, now seen corresponding path program 1 times [2019-12-07 20:54:31,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:54:31,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150782977] [2019-12-07 20:54:31,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:54:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 20:54:31,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150782977] [2019-12-07 20:54:31,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758449238] [2019-12-07 20:54:31,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:54:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:54:31,449 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:54:31,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:54:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 20:54:31,503 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:54:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 20:54:31,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:54:31,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 8 [2019-12-07 20:54:31,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99958933] [2019-12-07 20:54:31,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:54:31,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:54:31,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:54:31,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:54:31,532 INFO L87 Difference]: Start difference. First operand 1139 states and 1313 transitions. Second operand 4 states. [2019-12-07 20:54:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:54:31,787 INFO L93 Difference]: Finished difference Result 1210 states and 1386 transitions. [2019-12-07 20:54:31,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:54:31,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-12-07 20:54:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:54:31,788 INFO L225 Difference]: With dead ends: 1210 [2019-12-07 20:54:31,788 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:54:31,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:54:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:54:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:54:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:54:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:54:31,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2019-12-07 20:54:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:54:31,790 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:54:31,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:54:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:54:31,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:54:31,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:54:31,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:54:32,251 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 20:54:32,251 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 20:54:32,251 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 20:54:32,251 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 20:54:32,251 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 20:54:32,251 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 20:54:32,251 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 20:54:32,252 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1)) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= 13 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and (<= 15 ~a8~0) .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse4 .cse0 .cse1) (and .cse2 .cse4 (= ~a17~0 1) (= ~a12~0 8)) (and (< 13 ~a8~0) .cse4 .cse1))) [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 20:54:32,253 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 20:54:32,254 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 20:54:32,255 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1)) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= 13 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and (<= 15 ~a8~0) .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse4 .cse0 .cse1) (and .cse2 .cse4 (= ~a17~0 1) (= ~a12~0 8)) (and (< 13 ~a8~0) .cse4 .cse1))) [2019-12-07 20:54:32,255 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 20:54:32,255 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 20:54:32,255 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 20:54:32,255 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 20:54:32,255 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:54:32,255 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 20:54:32,255 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 20:54:32,255 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 20:54:32,256 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 20:54:32,257 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 20:54:32,257 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 20:54:32,257 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 20:54:32,257 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 20:54:32,257 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 20:54:32,257 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 20:54:32,257 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 20:54:32,257 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 530) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 20:54:32,258 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 20:54:32,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:54:32 BoogieIcfgContainer [2019-12-07 20:54:32,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:54:32,277 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:54:32,277 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:54:32,277 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:54:32,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:54:27" (3/4) ... [2019-12-07 20:54:32,281 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:54:32,312 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 20:54:32,314 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 20:54:32,316 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 20:54:32,318 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 20:54:32,402 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_002eeb7a-e259-4f78-82c8-77eca6f0e3d7/bin/utaipan/witness.graphml [2019-12-07 20:54:32,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:54:32,404 INFO L168 Benchmark]: Toolchain (without parser) took 6725.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 939.2 MB in the beginning and 1.2 GB in the end (delta: -261.7 MB). Peak memory consumption was 362.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:54:32,404 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:54:32,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:54:32,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:54:32,405 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:54:32,405 INFO L168 Benchmark]: RCFGBuilder took 1054.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 864.4 MB in the end (delta: 208.4 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:54:32,406 INFO L168 Benchmark]: TraceAbstraction took 5096.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 864.4 MB in the beginning and 812.6 MB in the end (delta: 51.8 MB). Peak memory consumption was 176.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:54:32,406 INFO L168 Benchmark]: Witness Printer took 125.55 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -1.0 MB). Free memory was 812.6 MB in the beginning and 1.2 GB in the end (delta: -388.3 MB). Peak memory consumption was 986.3 kB. Max. memory is 11.5 GB. [2019-12-07 20:54:32,407 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1054.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 864.4 MB in the end (delta: 208.4 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5096.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 864.4 MB in the beginning and 812.6 MB in the end (delta: 51.8 MB). Peak memory consumption was 176.1 MB. Max. memory is 11.5 GB. * Witness Printer took 125.55 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -1.0 MB). Free memory was 812.6 MB in the beginning and 1.2 GB in the end (delta: -388.3 MB). Peak memory consumption was 986.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 530]: 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: ((((((15 <= a8 && !(1 == a7)) && a21 == 1) || (13 == a8 && a20 == 1)) || (a21 == 1 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((13 < a8 && !(a16 == 6)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((15 <= a8 && !(1 == a7)) && a21 == 1) || (13 == a8 && a20 == 1)) || (a21 == 1 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((13 < a8 && !(a16 == 6)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 430 SDtfs, 1358 SDslu, 82 SDs, 0 SdLazy, 3179 SolverSat, 833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 337 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=9, 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, 955 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 127 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7568 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 360 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1248 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 400438 SizeOfPredicates, 1 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1008/1035 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...