./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.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_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/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 29670da151301b8436a6c7ddafad57f5257b4a8d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 21:21:32,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:21:32,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:21:32,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:21:32,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:21:32,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:21:32,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:21:32,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:21:32,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:21:32,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:21:32,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:21:32,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:21:32,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:21:32,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:21:32,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:21:32,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:21:32,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:21:32,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:21:32,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:21:32,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:21:32,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:21:32,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:21:32,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:21:32,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:21:32,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:21:32,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:21:32,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:21:32,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:21:32,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:21:32,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:21:32,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:21:32,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:21:32,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:21:32,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:21:32,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:21:32,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:21:32,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:21:32,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:21:32,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:21:32,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:21:32,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:21:32,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:21:32,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:21:32,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:21:32,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:21:32,859 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:21:32,859 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:21:32,859 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:21:32,860 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:21:32,860 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:21:32,860 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:21:32,860 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:21:32,860 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:21:32,860 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:21:32,861 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:21:32,861 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:21:32,861 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:21:32,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:21:32,862 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:21:32,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:21:32,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:21:32,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:21:32,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:21:32,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:21:32,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:21:32,863 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:21:32,863 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:21:32,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:21:32,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:21:32,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:21:32,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:21:32,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:21:32,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:21:32,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:21:32,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:21:32,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:21:32,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:21:32,865 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:21:32,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:21:32,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:21:32,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:21:32,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:21:32,866 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_c3adfc19-7e86-48c8-a0b2-989fabf560b2/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 -> 29670da151301b8436a6c7ddafad57f5257b4a8d [2019-12-07 21:21:32,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:21:32,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:21:32,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:21:32,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:21:32,990 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:21:32,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2019-12-07 21:21:33,029 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/data/289c7927f/ec78d35c4a504ee890fad359445dd8c0/FLAG564254227 [2019-12-07 21:21:33,509 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:21:33,510 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2019-12-07 21:21:33,520 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/data/289c7927f/ec78d35c4a504ee890fad359445dd8c0/FLAG564254227 [2019-12-07 21:21:33,530 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/data/289c7927f/ec78d35c4a504ee890fad359445dd8c0 [2019-12-07 21:21:33,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:21:33,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:21:33,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:21:33,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:21:33,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:21:33,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaa2f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33, skipping insertion in model container [2019-12-07 21:21:33,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:21:33,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:21:33,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:21:33,846 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:21:33,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:21:33,909 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:21:33,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33 WrapperNode [2019-12-07 21:21:33,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:21:33,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:21:33,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:21:33,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:21:33,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:21:33,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:21:33,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:21:33,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:21:33,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:33,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... [2019-12-07 21:21:34,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:21:34,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:21:34,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:21:34,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:21:34,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/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 21:21:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:21:34,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:21:35,082 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:21:35,083 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 21:21:35,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:35 BoogieIcfgContainer [2019-12-07 21:21:35,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:21:35,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:21:35,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:21:35,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:21:35,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:21:33" (1/3) ... [2019-12-07 21:21:35,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6128ba37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:21:35, skipping insertion in model container [2019-12-07 21:21:35,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:33" (2/3) ... [2019-12-07 21:21:35,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6128ba37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:21:35, skipping insertion in model container [2019-12-07 21:21:35,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:35" (3/3) ... [2019-12-07 21:21:35,090 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label25.c [2019-12-07 21:21:35,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:21:35,102 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:21:35,110 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:21:35,127 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:21:35,127 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:21:35,127 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:21:35,128 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:21:35,128 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:21:35,128 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:21:35,128 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:21:35,128 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:21:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 21:21:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 21:21:35,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:35,145 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 21:21:35,146 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash -839556570, now seen corresponding path program 1 times [2019-12-07 21:21:35,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:35,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627426168] [2019-12-07 21:21:35,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:35,398 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 21:21:35,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627426168] [2019-12-07 21:21:35,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:35,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:35,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043364629] [2019-12-07 21:21:35,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:35,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:35,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:35,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:35,419 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 21:21:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:35,836 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 21:21:35,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:35,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 21:21:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:35,847 INFO L225 Difference]: With dead ends: 297 [2019-12-07 21:21:35,847 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 21:21:35,850 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 21:21:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 21:21:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 21:21:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 21:21:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-12-07 21:21:35,894 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-12-07 21:21:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:35,894 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-12-07 21:21:35,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-12-07 21:21:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 21:21:35,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:35,897 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 21:21:35,897 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash -523029376, now seen corresponding path program 1 times [2019-12-07 21:21:35,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:35,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471853449] [2019-12-07 21:21:35,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:35,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471853449] [2019-12-07 21:21:35,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:35,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:35,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760945999] [2019-12-07 21:21:35,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:35,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:35,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:35,939 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-12-07 21:21:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:36,192 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-12-07 21:21:36,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:36,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 21:21:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:36,195 INFO L225 Difference]: With dead ends: 644 [2019-12-07 21:21:36,195 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 21:21:36,196 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 21:21:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 21:21:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 21:21:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 21:21:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-12-07 21:21:36,215 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 76 [2019-12-07 21:21:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:36,215 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-12-07 21:21:36,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-12-07 21:21:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 21:21:36,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:36,218 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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 21:21:36,219 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:36,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:36,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1468753973, now seen corresponding path program 1 times [2019-12-07 21:21:36,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:36,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331216270] [2019-12-07 21:21:36,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 21:21:36,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331216270] [2019-12-07 21:21:36,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:36,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:36,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476119819] [2019-12-07 21:21:36,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:36,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:36,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:36,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:36,253 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 3 states. [2019-12-07 21:21:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:36,479 INFO L93 Difference]: Finished difference Result 1070 states and 1787 transitions. [2019-12-07 21:21:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:36,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 21:21:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:36,482 INFO L225 Difference]: With dead ends: 1070 [2019-12-07 21:21:36,482 INFO L226 Difference]: Without dead ends: 642 [2019-12-07 21:21:36,483 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 21:21:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-07 21:21:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 429. [2019-12-07 21:21:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 21:21:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-12-07 21:21:36,497 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 83 [2019-12-07 21:21:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:36,497 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-12-07 21:21:36,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-12-07 21:21:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 21:21:36,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:36,498 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:36,499 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash 818274791, now seen corresponding path program 1 times [2019-12-07 21:21:36,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:36,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073598304] [2019-12-07 21:21:36,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:36,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073598304] [2019-12-07 21:21:36,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:36,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:36,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975630957] [2019-12-07 21:21:36,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:36,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:36,560 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 4 states. [2019-12-07 21:21:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:36,842 INFO L93 Difference]: Finished difference Result 942 states and 1520 transitions. [2019-12-07 21:21:36,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:21:36,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 21:21:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:36,845 INFO L225 Difference]: With dead ends: 942 [2019-12-07 21:21:36,845 INFO L226 Difference]: Without dead ends: 514 [2019-12-07 21:21:36,846 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 21:21:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-07 21:21:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-12-07 21:21:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-07 21:21:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 783 transitions. [2019-12-07 21:21:36,858 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 783 transitions. Word has length 86 [2019-12-07 21:21:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:36,858 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 783 transitions. [2019-12-07 21:21:36,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 783 transitions. [2019-12-07 21:21:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 21:21:36,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:36,859 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:36,860 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1374587951, now seen corresponding path program 1 times [2019-12-07 21:21:36,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:36,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960307581] [2019-12-07 21:21:36,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:36,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960307581] [2019-12-07 21:21:36,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:36,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:36,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867226837] [2019-12-07 21:21:36,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:36,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:36,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:36,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:36,912 INFO L87 Difference]: Start difference. First operand 500 states and 783 transitions. Second operand 4 states. [2019-12-07 21:21:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:37,258 INFO L93 Difference]: Finished difference Result 1212 states and 1947 transitions. [2019-12-07 21:21:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:37,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 21:21:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:37,261 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 21:21:37,261 INFO L226 Difference]: Without dead ends: 784 [2019-12-07 21:21:37,262 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 21:21:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-07 21:21:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-12-07 21:21:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 21:21:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1158 transitions. [2019-12-07 21:21:37,277 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1158 transitions. Word has length 90 [2019-12-07 21:21:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:37,277 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1158 transitions. [2019-12-07 21:21:37,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1158 transitions. [2019-12-07 21:21:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 21:21:37,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:37,278 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2019-12-07 21:21:37,278 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:37,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:37,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1287134350, now seen corresponding path program 1 times [2019-12-07 21:21:37,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:37,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209920622] [2019-12-07 21:21:37,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:37,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209920622] [2019-12-07 21:21:37,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:37,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:37,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037366903] [2019-12-07 21:21:37,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:37,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:37,311 INFO L87 Difference]: Start difference. First operand 784 states and 1158 transitions. Second operand 3 states. [2019-12-07 21:21:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:37,541 INFO L93 Difference]: Finished difference Result 1709 states and 2541 transitions. [2019-12-07 21:21:37,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:37,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-07 21:21:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:37,546 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 21:21:37,546 INFO L226 Difference]: Without dead ends: 926 [2019-12-07 21:21:37,548 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 21:21:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-12-07 21:21:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-12-07 21:21:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 21:21:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1015 transitions. [2019-12-07 21:21:37,571 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1015 transitions. Word has length 93 [2019-12-07 21:21:37,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:37,571 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1015 transitions. [2019-12-07 21:21:37,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1015 transitions. [2019-12-07 21:21:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 21:21:37,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:37,574 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1] [2019-12-07 21:21:37,574 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:37,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1197910724, now seen corresponding path program 1 times [2019-12-07 21:21:37,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:37,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800823390] [2019-12-07 21:21:37,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:21:37,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800823390] [2019-12-07 21:21:37,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:37,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:21:37,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555701329] [2019-12-07 21:21:37,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:37,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:37,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:37,635 INFO L87 Difference]: Start difference. First operand 784 states and 1015 transitions. Second operand 4 states. [2019-12-07 21:21:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:37,980 INFO L93 Difference]: Finished difference Result 2064 states and 2705 transitions. [2019-12-07 21:21:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:37,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 21:21:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:37,985 INFO L225 Difference]: With dead ends: 2064 [2019-12-07 21:21:37,985 INFO L226 Difference]: Without dead ends: 1281 [2019-12-07 21:21:37,986 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 21:21:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-12-07 21:21:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 713. [2019-12-07 21:21:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-07 21:21:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 920 transitions. [2019-12-07 21:21:38,000 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 920 transitions. Word has length 101 [2019-12-07 21:21:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:38,000 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 920 transitions. [2019-12-07 21:21:38,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 920 transitions. [2019-12-07 21:21:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 21:21:38,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:38,002 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-12-07 21:21:38,002 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1118925776, now seen corresponding path program 1 times [2019-12-07 21:21:38,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:38,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882458945] [2019-12-07 21:21:38,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:38,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882458945] [2019-12-07 21:21:38,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:38,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:38,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698650836] [2019-12-07 21:21:38,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:38,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:38,066 INFO L87 Difference]: Start difference. First operand 713 states and 920 transitions. Second operand 3 states. [2019-12-07 21:21:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:38,254 INFO L93 Difference]: Finished difference Result 784 states and 995 transitions. [2019-12-07 21:21:38,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:38,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-12-07 21:21:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:38,255 INFO L225 Difference]: With dead ends: 784 [2019-12-07 21:21:38,255 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:21:38,256 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 21:21:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:21:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:21:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:21:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:21:38,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-12-07 21:21:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:38,257 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:21:38,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:21:38,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:21:38,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 21:21:38,391 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and (not .cse1) .cse0))) [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 21:21:38,392 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 21:21:38,393 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and (not .cse1) .cse0))) [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 21:21:38,394 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 21:21:38,395 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:21:38,396 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 21:21:38,396 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 21:21:38,396 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 21:21:38,396 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 21:21:38,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:21:38 BoogieIcfgContainer [2019-12-07 21:21:38,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:21:38,409 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:21:38,409 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:21:38,410 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:21:38,410 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:35" (3/4) ... [2019-12-07 21:21:38,412 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:21:38,427 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 21:21:38,428 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 21:21:38,430 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 21:21:38,431 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 21:21:38,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3adfc19-7e86-48c8-a0b2-989fabf560b2/bin/utaipan/witness.graphml [2019-12-07 21:21:38,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:21:38,513 INFO L168 Benchmark]: Toolchain (without parser) took 4979.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 929.2 MB in the beginning and 905.2 MB in the end (delta: 24.0 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:38,513 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:21:38,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 929.2 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:38,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.26 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 21:21:38,514 INFO L168 Benchmark]: Boogie Preprocessor took 40.07 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:38,514 INFO L168 Benchmark]: RCFGBuilder took 1082.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 844.3 MB in the end (delta: 206.4 MB). Peak memory consumption was 206.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:38,515 INFO L168 Benchmark]: TraceAbstraction took 3324.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 844.3 MB in the beginning and 926.9 MB in the end (delta: -82.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:21:38,515 INFO L168 Benchmark]: Witness Printer took 102.53 ms. Allocated memory is still 1.2 GB. Free memory was 926.9 MB in the beginning and 905.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:38,516 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 929.2 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.26 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 40.07 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1082.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 844.3 MB in the end (delta: 206.4 MB). Peak memory consumption was 206.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3324.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 844.3 MB in the beginning and 926.9 MB in the end (delta: -82.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 102.53 ms. Allocated memory is still 1.2 GB. Free memory was 926.9 MB in the beginning and 905.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: 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: ((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || (!(1 == a7) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || (!(1 == a7) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 478 SDtfs, 921 SDslu, 59 SDs, 0 SdLazy, 2354 SolverSat, 596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=784occurred in iteration=5, 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, 8 MinimizatonAttempts, 937 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 49 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3975 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 282 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 700 ConstructedInterpolants, 0 QuantifiedInterpolants, 136541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 166/166 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...